Sciweavers

721 search results - page 85 / 145
» Almost universal graphs
Sort
View
ICPR
2004
IEEE
14 years 11 months ago
Non-linear Reflectance Model for Bidirectional Texture Function Synthesis
A rough texture modelling involves a huge image data-set - the Bidirectional Texture Function (BTF). This 6-dimensional function depends on planar texture coordinates as well as o...
Jirí Filip, Michal Haindl
CADE
2003
Springer
14 years 10 months ago
The Model Evolution Calculus
The DPLL procedure is the basis of some of the most successful propositional satisfiability solvers to date. Although originally devised as a proofprocedure for first-order logic, ...
Peter Baumgartner, Cesare Tinelli
STOC
2003
ACM
178views Algorithms» more  STOC 2003»
14 years 10 months ago
Uniform hashing in constant time and linear space
Many algorithms and data structures employing hashing have been analyzed under the uniform hashing assumption, i.e., the assumption that hash functions behave like truly random fu...
Anna Östlin, Rasmus Pagh
MOBISYS
2007
ACM
14 years 9 months ago
Toward highly-available WSNs for assisted living
In response to the consistent increase of elder people living in their apartments, and the need for innovative non-obtrusive tools to connect elders to their caregivers, we starte...
Safwan Al-Omari, Weisong Shi
ALT
2002
Springer
14 years 6 months ago
How to Achieve Minimax Expected Kullback-Leibler Distance from an Unknown Finite Distribution
Abstract. We consider a problem that is related to the “Universal Encoding Problem” from information theory. The basic goal is to find rules that map “partial information”...
Dietrich Braess, Jürgen Forster, Tomas Sauer,...