Sciweavers

7988 search results - page 135 / 1598
» A Useful Undecidable Theory
Sort
View
ICCV
1995
IEEE
14 years 1 months ago
A Theory of Specular Surface Geometry
Atheoreticalframeworkisintroducedfortheperceptionofspecularsurfacegeometry.Whenanobserver moves in three-dimensional space, real scene features such as surface markings remain stat...
Michael Oren, Shree K. Nayar
ALENEX
2009
191views Algorithms» more  ALENEX 2009»
13 years 11 months ago
Theory and Practise of Monotone Minimal Perfect Hashing
Minimal perfect hash functions have been shown to be useful to compress data in several data management tasks. In particular, order-preserving minimal perfect hash functions [10] ...
Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Seba...
IEPOL
2006
67views more  IEPOL 2006»
13 years 10 months ago
Platform competition and broadband uptake: Theory and empirical evidence from the European union
Broadband access provides users with high speed, always-on connectivity to the Internet. Due to its superiority, broadband is seen as the way for consumers and firms to exploit th...
Walter Distaso, Paolo Lupi, Fabio M. Manenti
CORR
2007
Springer
98views Education» more  CORR 2007»
13 years 10 months ago
Bistable Biorders: A Sequential Domain Theory
We give a simple order-theoretic construction of a Cartesian closed category of sequential functions. It is based on bistable biorders, which are sets with a partial order — the ...
James Laird
INFSOF
2006
73views more  INFSOF 2006»
13 years 10 months ago
Theory and algorithms for slicing unstructured programs
Program slicing identifies parts of a program that potentially affect a chosen computation. It has many applications in software engineering, including maintenance, evolution and ...
Mark Harman, Arun Lakhotia, David Binkley