Sciweavers

148 search results - page 10 / 30
» The random Tukey depth
Sort
View
ASPLOS
2010
ACM
14 years 2 months ago
A randomized scheduler with probabilistic guarantees of finding bugs
This paper presents a randomized scheduler for finding concurrency bugs. Like current stress-testing methods, it repeatedly runs a given test program with supplied inputs. Howeve...
Sebastian Burckhardt, Pravesh Kothari, Madanlal Mu...
ISAAC
2007
Springer
102views Algorithms» more  ISAAC 2007»
14 years 1 months ago
Depth of Field and Cautious-Greedy Routing in Social Networks
Social networks support efficient decentralized search: people can collectively construct short paths to a specified target in the network. Rank-based friendship—where the prob...
David Barbella, George Kachergis, David Liben-Nowe...
TOG
2008
293views more  TOG 2008»
13 years 7 months ago
A perceptually validated model for surface depth hallucination
Capturing detailed surface geometry currently requires specialized equipment such as laser range scanners, which despite their high accuracy, leave gaps in the surfaces that must ...
Mashhuda Glencross, Gregory J. Ward, Francho Melen...
EMMCVPR
2001
Springer
14 years 1 days ago
A Hierarchical Markov Random Field Model for Figure-Ground Segregation
To segregate overlapping objects into depth layers requires the integration of local occlusion cues distributed over the entire image into a global percept. We propose to model thi...
Stella X. Yu, Tai Sing Lee, Takeo Kanade
CORR
2006
Springer
115views Education» more  CORR 2006»
13 years 7 months ago
Entropy-optimal Generalized Token Bucket Regulator
Abstract-- We derive the maximum entropy of a flow (information utility) which conforms to traffic constraints imposed by a generalized token bucket regulator, by taking into accou...
Ashutosh Deepak Gore, Abhay Karandikar