Sciweavers

Share
5 search results - page 1 / 1
» An improved constant-time approximation algorithm for maximu...
Sort
View
FOCS
2008
IEEE
9 years 2 months ago
Constant-Time Approximation Algorithms via Local Improvements
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
Huy N. Nguyen, Krzysztof Onak
ESA
2009
Springer
90views Algorithms» more  ESA 2009»
9 years 2 months ago
Storing a Compressed Function with Constant Time Access
We consider the problem of representing, in a space-efficient way, a function f : S → Σ such that any function value can be computed in constant time on a RAM. Specifically, ou...
Jóhannes B. Hreinsson, Morten Krøyer...
STOC
2009
ACM
123views Algorithms» more  STOC 2009»
9 years 8 months ago
An improved constant-time approximation algorithm for maximum~matchings
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
Yuichi Yoshida, Masaki Yamamoto, Hiro Ito
CORR
2011
Springer
210views Education» more  CORR 2011»
8 years 3 months ago
Statistical Compressed Sensing of Gaussian Mixture Models
A novel framework of compressed sensing, namely statistical compressed sensing (SCS), that aims at efficiently sampling a collection of signals that follow a statistical distribu...
Guoshen Yu, Guillermo Sapiro
TROB
2008
154views more  TROB 2008»
8 years 6 months ago
Large-Scale SLAM Building Conditionally Independent Local Maps: Application to Monocular Vision
SLAM algorithms based on local maps have been demonstrated to be well suited for mapping large environments as they reduce the computational cost and improve the consistency of the...
Pedro Pinies, Juan D. Tardós
books