3875 search results - page 231 / 775 » Approximation algorithms for the 0-extension problem |
326
click to vote
Lecture Notes
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
154
click to vote
ICPR
2008
IEEE
16 years 7 months ago
2008
IEEE
Clustering time-series data poses problems, which do not exist in traditional clustering in Euclidean space. Specifically, cluster prototype needs to be calculated, where common s...
141
click to vote
ICRA
2006
IEEE
16 years 8 days ago
2006
IEEE
– The paper deals with fitting of planar patches to 3D laser range data obtained by a mobile robot. The number and the initial position of the patches are unknown, hence their es...
155
click to vote
ISMVL
2009
IEEE
16 years 26 days ago
2009
IEEE
Using concepts from rough set theory we investigate the existence of approximative descriptions of collections of objects that can be extracted from data sets, a problem of intere...
163
click to vote
ICRA
2005
IEEE
15 years 12 months ago
2005
IEEE
— For the Simultaneous Localization and Mapping problem several efficient algorithms have been proposed that make use of a sparse information matrix representation (e.g. SEIF, T...