Sciweavers

1596 search results - page 58 / 320
» Human-Guided Simple Search
Sort
View
148
Voted
ACMSE
2007
ACM
15 years 8 months ago
Exploring the duality between skip lists and binary search trees
Although skip lists were introduced as an alternative to balanced binary search trees (BSTs), we show that the skip list can be interpreted as a type of randomly-balanced BST whos...
Brian C. Dean, Zachary H. Jones
134
Voted
ICC
2009
IEEE
122views Communications» more  ICC 2009»
15 years 10 months ago
Using Area Hierarchy for Multi-Resolution Storage and Search in Large Wireless Sensor Networks
—We consider multi-resolution storage, a technique for providing scalable adaptive data fidelity, necessary for many applications of large wireless sensor networks (WSNs). Altho...
Konrad Iwanicki, Maarten van Steen
FSE
2005
Springer
122views Cryptology» more  FSE 2005»
15 years 9 months ago
Analysis of the Bit-Search Generator and Sequence Compression Techniques
Abstract. Algebraic attacks on stream ciphers apply (at least theoretically) to all LFSR-based stream ciphers that are clocked in a simple and/or easily predictable way. One intere...
Aline Gouget, Hervé Sibert, Côme Berb...
GECCO
2005
Springer
112views Optimization» more  GECCO 2005»
15 years 9 months ago
Two improved differential evolution schemes for faster global search
Differential evolution (DE) is well known as a simple and efficient scheme for global optimization over continuous spaces. In this paper we present two new, improved variants of D...
Swagatam Das, Amit Konar, Uday Kumar Chakraborty
116
Voted
NIPS
2007
15 years 5 months ago
A learning framework for nearest neighbor search
Can we leverage learning techniques to build a fast nearest-neighbor (ANN) retrieval data structure? We present a general learning framework for the NN problem in which sample que...
Lawrence Cayton, Sanjoy Dasgupta