Sciweavers

3894 search results - page 204 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
ICPR
2008
IEEE
16 years 7 months ago
Time-series clustering by approximate prototypes
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...
Pasi Fränti, Pekka Nykänen, Ville Hautam...
ICRA
2006
IEEE
85views Robotics» more  ICRA 2006»
16 years 17 days ago
Extended EM for Planar Approximation of 3D Data
– 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...
Rolf Lakämper, Longin Jan Latecki
ECRTS
2009
IEEE
15 years 4 months ago
Approximate Bandwidth Allocation for Compositional Real-Time Systems
Allocation of bandwidth among components is a fundamental problem in compositional real-time systems. Stateof-the-art algorithms for bandwidth allocation use either exponential-ti...
Nathan Fisher, Farhana Dewan
ISMVL
2009
IEEE
161views Hardware» more  ISMVL 2009»
16 years 1 months ago
Mining Approximative Descriptions of Sets Using Rough Sets
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...
Dan A. Simovici, Selim Mimaroglu
ICRA
2005
IEEE
114views Robotics» more  ICRA 2005»
16 years 4 days ago
A Proof for the Approximate Sparsity of SLAM Information Matrices
— 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...
Udo Frese