Sciweavers

331 search results - page 44 / 67
» Approximation Algorithms for Connected Dominating Sets
Sort
View
AIPS
2004
15 years 1 months ago
Optimal Rectangle Packing: New Results
We present new results on the problem of finding an enclosing rectangle of minimum area that will contain a given a set of rectangles. Many simple scheduling tasks can be modelled...
Richard E. Korf
AAAI
2010
15 years 1 months ago
Local Search in Histogram Construction
The problem of dividing a sequence of values into segments occurs in database systems, information retrieval, and knowledge management. The challenge is to select a finite number ...
Felix Halim, Panagiotis Karras, Roland H. C. Yap
FOCM
2008
100views more  FOCM 2008»
14 years 11 months ago
Meshfree Thinning of 3D Point Clouds
An efficient data reduction scheme for the simplification of a surface given by a large set X of 3D point-samples is proposed. The data reduction relies on a recursive point remov...
Nira Dyn, Armin Iske, Holger Wendland
103
Voted
ICASSP
2010
IEEE
14 years 12 months ago
Guaranteed robust distributed estimation in a network of sensors
This paper proposes a guaranteed robust bounded-error distributed estimation algorithm. It may be employed to perform parameter estimation from data collected in a network of wire...
Jean-Benoist Leger, Michel Kieffer
ESA
2010
Springer
207views Algorithms» more  ESA 2010»
15 years 26 days ago
Budgeted Red-Blue Median and Its Generalizations
In a Content Distribution Network application, we have a set of servers and a set of clients to be connected to the servers. Often there are a few server types and a hard budget co...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...