752 search results - page 57 / 151 » Faster approximation algorithms for the minimum latency prob... |
126
click to vote
ICPR
2008
IEEE
15 years 9 months ago
2008
IEEE
We have considered a problem of continuous piecewise linear approximation of the digital curves with a minimum number of the line segments. Fast suboptimal algorithm for constrain...
112
click to vote
JDA
2007
15 years 3 months ago
2007
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 ...
128
Voted
WONS
2005
IEEE
15 years 8 months ago
2005
IEEE
—Wireless ad hoc radio networks have gained a lot of attention in recent years. We consider geometric networks, where nodes are located in a euclidean plane. We assume that each ...
165
click to vote
ISAAC
2009
Springer
15 years 9 months ago
2009
Springer
We introduce a new probing problem: what is the minimum number of cameras at fixed positions necessary and sufficient to reconstruct any strictly convex polygon contained in a dis...
165
click to vote
PDCAT
2005
Springer
15 years 8 months ago
2005
Springer
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...