Sciweavers

841 search results - page 91 / 169
» Approximability of Minimum AND-Circuits
Sort
View
JCO
2008
84views more  JCO 2008»
13 years 10 months ago
Partitioning a weighted partial order
The problem of partitioning a partially ordered set into a minimum number of chains is a well-known problem. In this paper we study a generalization of this problem, where we not ...
Linda S. Moonen, Frits C. R. Spieksma
JUCS
2008
151views more  JUCS 2008»
13 years 10 months ago
The Bit-Complexity of Finding Nearly Optimal Quadrature Rules for Weighted Integration
: Given a probability measure and a positive integer n. How to choose n knots and n weights such that the corresponding quadrature rule has the minimum worst-case error when appli...
Volker Bosserhoff
JGTOOLS
2006
72views more  JGTOOLS 2006»
13 years 10 months ago
Efficient Generation of Poisson-Disk Sampling Patterns
Poisson Disk sampling patterns are of interest to the graphics community because their blue-noise properties are desirable in sampling patterns for rendering, illumination, and ot...
Thouis R. Jones
ADHOC
2005
122views more  ADHOC 2005»
13 years 10 months ago
Maintaining weakly-connected dominating sets for clustering ad hoc networks
An ad hoc network is a multihop wireless communication network supporting mobile users. Network performance degradation is a major problem as the network becomes larger. Clusterin...
Yuanzhu Peter Chen, Arthur L. Liestman
JDA
2007
97views more  JDA 2007»
13 years 10 months ago
Local solutions for global problems in wireless networks
In this paper, we review a recently developed class of algorithms that solve global problems in unit distance wireless networks by means of local algorithms. A local algorithm is ...
Jorge Urrutia