Sciweavers

309 search results - page 13 / 62
» Partial Move A*
Sort
View
TIT
2008
121views more  TIT 2008»
14 years 9 months ago
Stability Results for Random Sampling of Sparse Trigonometric Polynomials
Recently, it has been observed that a sparse trigonometric polynomial, i.e. having only a small number of non-zero coefficients, can be reconstructed exactly from a small number o...
Holger Rauhut
IFL
2007
Springer
141views Formal Methods» more  IFL 2007»
15 years 3 months ago
Partial Parsing: Combining Choice with Commitment
Abstract. Parser combinators, often monadic, are a venerable and widelyused solution to read data from some external format. However, the capability to return a partial parse has, ...
Malcolm Wallace
IPL
2008
102views more  IPL 2008»
14 years 9 months ago
The connection between two ways of reasoning about partial functions
Undefined terms involving the application of partial functions and operators are common in program specifications and in discharging proof obligations that arise in design. One wa...
John S. Fitzgerald, Cliff B. Jones
CORR
2011
Springer
194views Education» more  CORR 2011»
14 years 4 months ago
Approachability of Convex Sets in Games with Partial Monitoring
We provide a necessary and sufficient condition under which a convex set is approachable in a game with partial monitoring, i.e. where players do not observe their opponents’ mo...
Vianney Perchet
CVPR
2006
IEEE
15 years 11 months ago
The Layout Consistent Random Field for Recognizing and Segmenting Partially Occluded Objects
This paper addresses the problem of detecting and segmenting partially occluded objects of a known category. We first define a part labelling which densely covers the object. Our ...
John M. Winn, Jamie Shotton