497 search results - page 76 / 100 » Approximating max-min linear programs with local algorithms |
ICPR
2006
IEEE
15 years 11 months ago
2006
IEEE
We present a dynamic inference algorithm in a globally parameterized nonlinear manifold and demonstrate it on the problem of visual tracking. An appearance manifold is usually non...
DCOSS
2009
Springer
15 years 4 months ago
2009
Springer
We consider dual classes of geometric coverage problems, in which disks, corresponding to coverage regions of sensors, are used to cover a region or set of points in the plane. The...
INFOCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
—This is by far the first paper considering joint optimization of link scheduling, routing and replication for disruption-tolerant networks (DTNs). The optimization problems for...
106
click to vote
SDM
2007
SIAM
14 years 11 months ago
2007
SIAM
Sequence segmentation is a central problem in the analysis of sequential and time-series data. In this paper we introduce and we study a novel variation to the segmentation proble...
ICALP
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. If the genetic maps of two species are modelled as permutations of (homologous) genes, the number of chromosomal rearrangements in the form of deletions, block moves, inv...