5595 search results - page 696 / 1119 » Approximation Algorithms for Clustering Problems |
270
Voted
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—The paper deals with efficient distribution of timely information to flows of mobile devices. We consider the case where a set of Information Dissemination Devices (IDDs) broa...
187
Voted
PPDP
2005
Springer
16 years 10 days ago
2005
Springer
The paper describes a constraint-based solution to the protein folding problem on face-centered cubic lattices—a biologically meaningful approximation of the general protein fol...
177
click to vote
STACS
1999
Springer
15 years 11 months ago
1999
Springer
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient ...
172
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
Suppose we are given a finite set of points P in R3 and a collection of polytopes T that are all translates of the same polytope T. We consider two problems in this paper. The firs...
154
Voted
CORR
2008
Springer
15 years 7 months ago
2008
Springer
The paper studies the problem of distributed static parameter (vector) estimation in sensor networks with nonlinear observation models and imperfect inter-sensor communication. We...