Sciweavers

3874 search results - page 197 / 775
» Approximation Algorithms for k-hurdle Problems
Sort
View
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 1 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
IPL
2008
78views more  IPL 2008»
15 years 6 months ago
An approximation ratio for biclustering
The problem of biclustering consists of the simultaneous clustering of rows and columns of a matrix such that each of the submatrices induced by a pair of row and column clusters ...
Kai Puolamäki, Sami Hanhijärvi, Gemma C....
UAI
2000
15 years 7 months ago
Value-Directed Belief State Approximation for POMDPs
We consider the problem belief-state monitoring for the purposes of implementing a policy for a partially-observable Markov decision process (POMDP), specifically how one might ap...
Pascal Poupart, Craig Boutilier
WEA
2005
Springer
107views Algorithms» more  WEA 2005»
15 years 12 months ago
Local Clustering of Large Graphs by Approximate Fiedler Vectors
Vectors [Extended Abstract] Pekka Orponen and Satu Elisa Schaeffer Laboratory for Theoretical Computer Science, P.O. Box 5400 FI-02015 TKK Helsinki University of Technology, Finlan...
Pekka Orponen, Satu Elisa Schaeffer