Sciweavers

1041 search results - page 163 / 209
» Randomizing Reductions of Search Problems
Sort
View
TSP
2008
151views more  TSP 2008»
13 years 7 months ago
Reduce and Boost: Recovering Arbitrary Sets of Jointly Sparse Vectors
The rapid developing area of compressed sensing suggests that a sparse vector lying in a high dimensional space can be accurately and efficiently recovered from only a small set of...
Moshe Mishali, Yonina C. Eldar
CORR
2007
Springer
115views Education» more  CORR 2007»
13 years 7 months ago
Error Exponents of Erasure/List Decoding Revisited via Moments of Distance Enumerators
The analysis of random coding error exponents pertaining to erasure/list decoding, due to Forney, is revisited. Instead of using Jensen’s inequality as well as some other inequa...
Neri Merhav
ECCV
2008
Springer
14 years 9 months ago
Fast Automatic Single-View 3-d Reconstruction of Urban Scenes
We consider the problem of estimating 3-d structure from a single still image of an outdoor urban scene. Our goal is to efficiently create 3-d models which are visually pleasant. W...
Olga Barinova, Vadim Konushin, Anton Yakubenko, Ke...
ICALP
2001
Springer
14 years 7 days ago
Hidden Pattern Statistics
Abstract. We consider the sequence comparison problem, also known as “hidden pattern” problem, where one searches for a given subsequence in a text (rather than a string unders...
Philippe Flajolet, Yves Guivarc'h, Wojciech Szpank...
FLAIRS
2008
13 years 10 months ago
Conditional and Composite Constraints with Preferences
Preferences in constraint problems are common but significant in many real world applications. In this paper, we extend our conditional and composite CSP (CCCSP) framework, managi...
Malek Mouhoub, Amrudee Sukpan