331 search results - page 44 / 67 » Approximation Algorithms for Connected Dominating Sets |
111
Voted
AIPS
2004
15 years 4 months ago
2004
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...
225
click to vote
AAAI
2010
15 years 4 months ago
2010
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 ...
119
Voted
FOCM
2008
15 years 3 months ago
2008
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...
135
click to vote
ICASSP
2010
IEEE
15 years 3 months ago
2010
IEEE
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...
120
click to vote
ESA
2010
Springer
15 years 4 months ago
2010
Springer
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...