Sciweavers

42230 search results - page 419 / 8446
» Algorithms and Complexity Results for
Sort
View
SIGACT
2010
74views more  SIGACT 2010»
15 years 5 months ago
Typically-correct derandomization
A fundamental question in complexity theory is whether every randomized polynomial time algorithm can be simulated by a deterministic polynomial time algorithm (that is, whether B...
Ronen Shaltiel
ICONIP
2009
15 years 4 months ago
Robust Incremental Subspace Learning for Object Tracking
In this paper, we introduce a novel incremental subspace based object tracking algorithm. The two major contributions of our work are the Robust PCA based occlusion handling scheme...
Gang Yu, Zhiwei Hu, Hongtao Lu
DCC
2005
IEEE
16 years 6 months ago
Towards Practical Minimum-Entropy Universal Decoding
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
Todd P. Coleman, Muriel Médard, Michelle Ef...
FOCS
2006
IEEE
16 years 28 days ago
Computing Nash Equilibria: Approximation and Smoothed Complexity
We advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving two major open problems in the approximation of Nash equilibria an...
Xi Chen, Xiaotie Deng, Shang-Hua Teng
ICDE
2009
IEEE
129views Database» more  ICDE 2009»
16 years 8 months ago
Computing Distance Histograms Efficiently in Scientific Databases
Abstract-- Particle simulation has become an important research tool in many scientific and engineering fields. Data generated by such simulations impose great challenges to databa...
Yi-Cheng Tu, Shaoping Chen, Sagar Pandit