4110 search results - page 346 / 822 » Efficient algorithms for the 2-gathering problem |
179
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Kinetic data structures provide a framework for computing combinatorial properties of continuously moving objects. Although kinetic data structures for many problems have...
246
click to vote
GIS
2004
ACM
16 years 7 months ago
2004
ACM
This paper discusses a variety of ways to place diagrams like pie charts on maps, in particular, administrative subdivisions. The different ways come from different models of the ...
171
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
: Given a logical topology and a physical topology , the survivable logical topology design problem in an IP-overWDM optical network is to map the logical links into lightpaths in ...
174
click to vote
RECOMB
2006
Springer
16 years 7 months ago
2006
Springer
Meiotic recombination is a fundamental biological event and one of the principal evolutionary forces responsible for shaping genetic variation within species. In addition to its fu...
217
click to vote
SIAMIS
2010
15 years 1 months ago
2010
We generalize the primal-dual hybrid gradient (PDHG) algorithm proposed by Zhu and Chan in [M. Zhu, and T. F. Chan, An Efficient Primal-Dual Hybrid Gradient Algorithm for Total Var...