Sciweavers

1573 search results - page 143 / 315
» A Data Structure for Sponsored Search
Sort
View
SODA
2012
ACM
174views Algorithms» more  SODA 2012»
11 years 11 months ago
Using hashing to solve the dictionary problem
We consider the dictionary problem in external memory and improve the update time of the wellknown buffer tree by roughly a logarithmic factor. For any λ ≥ max{lg lg n, logM/B(...
John Iacono, Mihai Patrascu
ICML
1997
IEEE
14 years 10 months ago
Learning Belief Networks in the Presence of Missing Values and Hidden Variables
In recent years there has been a flurry of works on learning probabilistic belief networks. Current state of the art methods have been shown to be successful for two learning scen...
Nir Friedman
STOC
2001
ACM
159views Algorithms» more  STOC 2001»
14 years 9 months ago
Optimal static range reporting in one dimension
We consider static one dimensional range searching problems. These problems are to build static data structures for an integer set S U, where U = {0, 1, . . . , 2w - 1}, which su...
Stephen Alstrup, Gerth Stølting Brodal, The...
GECCO
2004
Springer
14 years 2 months ago
Hybridizing Evolutionary Testing with the Chaining Approach
Fitness functions derived for certain white-box test goals can cause problems for Evolutionary Testing (ET), due to a lack of sufficient guidance to the required test data. Often t...
Phil McMinn, Mike Holcombe
DEXAW
2004
IEEE
166views Database» more  DEXAW 2004»
14 years 26 days ago
Development of Flexible Peer-To-Peer Information Systems Using Adaptable Mobile Agents
Wide-area networks provide an easy access to many different distributed and heterogeneous data sources. The development of automated operating tools is still complex, particularly...
Jean-Paul Arcangeli, Sebastien Leriche, Marc Pante...