Sciweavers

250 search results - page 29 / 50
» The Art of the Possible
Sort
View
PODS
2003
ACM
158views Database» more  PODS 2003»
15 years 9 months ago
Computing full disjunctions
Full disjunctions are an associative extension of the outerjoin operator to an arbitrary number of relations. Their main advantage is the ability to maximally combine data from di...
Yaron Kanza, Yehoshua Sagiv
CVPR
2010
IEEE
15 years 6 months ago
Warping Background Subtraction
We present a background model that differentiates between background motion and foreground objects. Unlike most models that represent the variability of pixel intensity at a partic...
Teresa Ko, Stefano Soatto, Deborah Estrin
ICFP
2009
ACM
15 years 4 months ago
Finding race conditions in Erlang with QuickCheck and PULSE
We address the problem of testing and debugging concurrent, distributed Erlang applications. In concurrent programs, race conditions are a common class of bugs and are very hard t...
Koen Claessen, Michal Palka, Nicholas Smallbone, J...
APPROX
2009
Springer
156views Algorithms» more  APPROX 2009»
15 years 4 months ago
An Analysis of Random-Walk Cuckoo Hashing
In this paper, we provide a polylogarithmic bound that holds with high probability on the insertion time for cuckoo hashing under the random-walk insertion method. Cuckoo hashing ...
Alan M. Frieze, Páll Melsted, Michael Mitze...
ICASSP
2008
IEEE
15 years 4 months ago
Graph laplacian for interactive image retrieval
Interactive image search or relevance feedback is the process which helps a user refining his query and finding difficult target categories. This consists in a step-by-step lab...
Hichem Sahbi, Patrick Etyngier, Jean-Yves Audibert...