Sciweavers

347 search results - page 64 / 70
» The Berlekamp-Massey Algorithm revisited
Sort
View
CCR
2004
103views more  CCR 2004»
14 years 10 months ago
Reconsidering wireless systems with multiple radios
The tremendous popularity of wireless systems in recent years has led to the commoditization of RF transceivers (radios) whose prices have fallen dramatically. The lower cost allo...
Paramvir Bahl, Atul Adya, Jitendra Padhye, Alec Wo...
STACS
2010
Springer
15 years 5 months ago
Long Non-crossing Configurations in the Plane
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...
Noga Alon, Sridhar Rajagopalan, Subhash Suri
WWW
2006
ACM
15 years 11 months ago
Random sampling from a search engine's index
We revisit a problem introduced by Bharat and Broder almost a decade ago: how to sample random pages from the corpus of documents indexed by a search engine, using only the search...
Ziv Bar-Yossef, Maxim Gurevich
PG
2003
IEEE
15 years 4 months ago
Breaking the Walls: Scene Partitioning and Portal Creation
In this paper we revisit the cells-and-portals visibility methods, originally developed for the special case of architectural interiors. We define an effectiveness measure for a ...
Alon Lerner, Yiorgos Chrysanthou, Daniel Cohen-Or
COCOON
2009
Springer
15 years 5 months ago
On Smoothed Analysis of Quicksort and Hoare's Find
We provide a smoothed analysis of Hoare’s find algorithm and we revisit the smoothed analysis of quicksort. Hoare’s find algorithm – often called quickselect – is an easy...
Mahmoud Fouz, Manfred Kufleitner, Bodo Manthey, Ni...