Sciweavers

5316 search results - page 993 / 1064
» Which Search Problems Are Random
Sort
View
129
Voted
RECOMB
2005
Springer
16 years 1 months ago
Improved Duplication Models for Proteome Network Evolution
Protein-protein interaction networks, particularly that of the yeast S. Cerevisiae, have recently been studied extensively. These networks seem to satisfy the small world property ...
Gürkan Bebek, Petra Berenbrink, Colin Cooper,...
STOC
2004
ACM
134views Algorithms» more  STOC 2004»
16 years 1 months ago
Better extractors for better codes?
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
Venkatesan Guruswami
192
Voted
SIGMOD
2007
ACM
165views Database» more  SIGMOD 2007»
16 years 1 months ago
Sharing aggregate computation for distributed queries
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...
Ryan Huebsch, Minos N. Garofalakis, Joseph M. Hell...
118
Voted
SIGMOD
2004
ACM
142views Database» more  SIGMOD 2004»
16 years 1 months ago
Understanding Web Query Interfaces: Best-Effort Parsing with Hidden Syntax
Recently, the Web has been rapidly "deepened" by many searchable databases online, where data are hidden behind query forms. For modelling and integrating Web databases,...
Zhen Zhang, Bin He, Kevin Chen-Chuan Chang
MOBIHOC
2008
ACM
16 years 19 days ago
Localized distance-sensitive service discovery in wireless sensor networks
In this paper, we identify a new problem in wireless sensor networks, distance sensitive service discovery, where nearby or closest service selection guarantee is expected. We pro...
Xu Li, Nicola Santoro, Ivan Stojmenovic