667 search results - page 98 / 134 » Approximation algorithms for connected facility location pro... |
185
click to vote
TKDE
2008
15 years 6 months ago
2008
Given a dataset P, a k-means query returns k points in space (called centers), such that the average squared distance between each point in P and its nearest center is minimized. S...
165
click to vote
IJRR
2006
15 years 6 months ago
2006
Abstract-- This paper describes an on-line algorithm for multirobot simultaneous localization and mapping (SLAM). We take as our starting point the single-robot Rao-Blackwellized p...
159
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V , with m demand pairs ⊆ V × ...
183
click to vote
ICIP
2005
IEEE
16 years 8 months ago
2005
IEEE
In this paper we explore the problem of accurately segmenting a person from a video given only approximate location of that person. Unlike previous work which assumes that the app...
160
Voted
PG
2007
IEEE
16 years 22 days ago
2007
IEEE
A new geometry-based finite difference method for a fast and reliable detection of perceptually salient curvature extrema on surfaces approximated by dense triangle meshes is pro...