Sciweavers

19383 search results - page 3672 / 3877
» Estimating the
Sort
View
DL
2000
Springer
137views Digital Library» more  DL 2000»
15 years 11 months ago
Server selection on the World Wide Web
We evaluate server selection methods in a Web environment, modeling a digital library which makes use of existing Web search servers rather than building its own index. The evalua...
Nick Craswell, Peter Bailey, David Hawking
EDBT
2000
ACM
15 years 11 months ago
Dynamically Optimizing High-Dimensional Index Structures
In high-dimensional query processing, the optimization of the logical page-size of index structures is an important research issue. Even very simple query processing techniques suc...
Christian Böhm, Hans-Peter Kriegel
AINA
2010
IEEE
15 years 11 months ago
A Fully Dynamic and Self-Stabilizing TDMA Scheme for Wireless Ad-hoc Networks
One important challenge in wireless ad hoc networks is to achieve collision free communication. Many MAC layer protocols have been proposed by considering various communication mod...
Bezawada Bruhadeshwar, Kishore Kothapalli, Indira ...
ICDE
2010
IEEE
240views Database» more  ICDE 2010»
15 years 11 months ago
Top-K aggregation queries over large networks
Searching and mining large graphs today is critical to a variety of application domains, ranging from personalized recommendation in social networks, to searches for functional ass...
Xifeng Yan, Bin He, Feida Zhu, Jiawei Han
FOCS
1999
IEEE
15 years 11 months ago
Near-Optimal Conversion of Hardness into Pseudo-Randomness
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson
« Prev « First page 3672 / 3877 Last » Next »