Sciweavers

216 search results - page 19 / 44
» On the number of minima of a random polynomial
Sort
View
APPROX
2009
Springer
156views Algorithms» more  APPROX 2009»
14 years 2 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...
DAM
2007
88views more  DAM 2007»
13 years 7 months ago
Hybrid one-dimensional reversible cellular automata are regular
It is shown that the set of hybrid one-dimensional reversible cellular automata (CA) with the periodic boundary condition is a regular set. This has several important consequences...
Jesse D. Bingham, Brad Bingham
CVPR
2008
IEEE
14 years 9 months ago
Principled fusion of high-level model and low-level cues for motion segmentation
High-level generative models provide elegant descriptions of videos and are commonly used as the inference framework in many unsupervised motion segmentation schemes. However, app...
Arasanathan Thayananthan, Masahiro Iwasaki, Robert...
ICDE
2008
IEEE
127views Database» more  ICDE 2008»
14 years 9 months ago
Efficient Processing of Top-k Queries in Uncertain Databases
This work introduces novel polynomial algorithms for processing top-k queries in uncertain databases under the generally adopted model of x-relations. An x-relation consists of a n...
Ke Yi, Feifei Li, George Kollios, Divesh Srivastav...
INFORMATICALT
2010
88views more  INFORMATICALT 2010»
13 years 6 months ago
Inapproximability Results for Wavelength Assignment in WDM Optical Networks
We address the issue of inapproximability of the wavelength assignment problem in wavelength division multiplexing (WDM) optical networks. We prove that in an n-node WDM optical ne...
Keqin Li