2188 search results - page 103 / 438 » Instance-Optimal Geometric Algorithms |
113
click to vote
CORR
2006
Springer
15 years 2 months ago
2006
Springer
Gossip algorithms for aggregation have recently received significant attention for sensor network applications because of their simplicity and robustness in noisy and uncertain en...
155
click to vote
INFOCOM
2012
IEEE
13 years 4 months ago
2012
IEEE
—A cardinal prerequisite for the system design of a sensor network, is to understand the geometric environment where sensor nodes are deployed. The global topology of a largescal...
106
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
120
click to vote
COMPGEOM
2003
ACM
15 years 7 months ago
2003
ACM
Given a polygonal curve and a geometric graph, we describe an efficient algorithm to find a path in the graph which is most similar to the curve, using the well-known Fr´echet d...
143
click to vote
WAOA
2010
Springer
15 years 9 days ago
2010
Springer
We study approximation solutions for the densest k-subgraph problem (DS-k) on several classes of intersection graphs. We adopt the concept of -quasi elimination orders, introduced ...