2283 search results - page 315 / 457 » Bounds of Graph Characteristics |
151
Voted
STACS
2010
Springer
16 years 26 days ago
2010
Springer
Abstract. A Boolean function on N variables is called evasive if its decision-tree complexity is N. A sequence Bn of Boolean functions is eventually evasive if Bn is evasive for al...
224
click to vote
HLK
2003
IEEE
15 years 11 months ago
2003
IEEE
It’s common experience for human vision to perceive full 3D shape and scene from a single 2D image with the occluded parts “filled-in” by prior visual knowledge. In this pa...
177
click to vote
STOC
2010
ACM
15 years 10 months ago
2010
ACM
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
160
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Cuckoo hashing with a stash is a robust high-performance hashing scheme that can be used in many real-life applications. It complements cuckoo hashing by adding a small stash stor...
140
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
This paper explores how shape, motion, and lighting interact in the case of a two-frame motion sequence. We consider a rigid object with Lambertian reflectance properties undergoi...