Sciweavers

331 search results - page 50 / 67
» Using Redundant Constraints for Refinement
Sort
View
STOC
2009
ACM
120views Algorithms» more  STOC 2009»
14 years 8 months ago
Bit-probe lower bounds for succinct data structures
We prove lower bounds on the redundancy necessary to represent a set S of objects using a number of bits close to the information-theoretic minimum log2 |S|, while answering vario...
Emanuele Viola
POPL
2010
ACM
13 years 10 months ago
Programming with angelic nondeterminism
Angelic nondeterminism can play an important role in program development. It simplifies specifications, for example in deriving programs with a refinement calculus; it is the form...
Rastislav Bodík, Satish Chandra, Joel Galen...
TOG
2008
239views more  TOG 2008»
13 years 7 months ago
Skeleton extraction by mesh contraction
eleton is a very useful 1D structure to abstract the geometry and topology of a 3D object. Extraction of curve-skeletons is a fundamental problem in computer graphics, visualizatio...
Oscar Kin-Chung Au, Chiew-Lan Tai, Hung-Kuo Chu, D...
ECCV
2002
Springer
14 years 9 months ago
New Techniques for Automated Architectural Reconstruction from Photographs
Abstract. We investigate a strategy for reconstructing of buildings from multiple (uncalibrated) images. In a similar manner to the Facade approach we first generate a coarse piece...
Tomás Werner, Andrew Zisserman
NDJFL
2000
79views more  NDJFL 2000»
13 years 7 months ago
An Information-Based Theory of Conditionals
We present an approach to combining three areas of research which we claim are all based on information theory: knowledge representation in Artificial Intelligence and Cognitive Sc...
Wayne Wobcke