Sciweavers

537 search results - page 83 / 108
» A new upper bound for 3-SAT
Sort
View
QEST
2008
IEEE
14 years 2 months ago
Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
Kousha Etessami, Dominik Wojtczak, Mihalis Yannaka...
COCO
2009
Springer
106views Algorithms» more  COCO 2009»
14 years 3 months ago
Improved Approximation of Linear Threshold Functions
We prove two main results on how arbitrary linear threshold functions f(x) = sign(w · x − θ) over the n-dimensional Boolean hypercube can be approximated by simple threshold f...
Ilias Diakonikolas, Rocco A. Servedio
ICCV
2009
IEEE
15 years 1 months ago
Time-Constrained Photography
Capturing multiple photos at different focus settings is a powerful approach for reducing optical blur, but how many photos should we capture within a fixed time budget? We develop...
Samuel W. Hasinoff, Kiriakos N. Kutulakos, Frédo ...
ICCV
2009
IEEE
15 years 1 months ago
The Dimensionality of Scene Appearance
Low-rank approximation of image collections (e.g., via PCA) is a popular tool in many areas of computer vision. Yet, surprisingly little is known justifying the observation that...
Rahul Garg, Hao Du, Steven M. Seitz, Noah Snavely
ICPR
2004
IEEE
14 years 9 months ago
Classification Probability Analysis of Principal Component Null Space Analysis
In a previous paper [1], we have presented a new linear classification algorithm, Principal Component Null Space Analysis (PCNSA) which is designed for problems like object recogn...
Namrata Vaswani, Rama Chellappa