Sciweavers

620 search results - page 68 / 124
» Algorithms for Rewriting Aggregate Queries Using Views
Sort
View
EWSN
2004
Springer
16 years 3 months ago
ACE: An Emergent Algorithm for Highly Uniform Cluster Formation
The efficient subdivision of a sensor network into uniform, mostly non-overlapping clusters of physically close nodes is an important building block in the design of efficient uppe...
Haowen Chan, Adrian Perrig
WWW
2001
ACM
16 years 4 months ago
When experts agree: using non-affiliated experts to rank popular topics
In response to a query a search engine returns a ranked list of documents. If the query is on a popular topic (i.e., it matches many documents) then the returned list is usually t...
Krishna Bharat, George A. Mihaila
SIGMOD
2006
ACM
114views Database» more  SIGMOD 2006»
16 years 4 months ago
Ordering the attributes of query results
There has been a great deal of interest in the past few years on ranking of results of queries on structured databases, including work on probabilistic information retrieval, rank...
Gautam Das, Vagelis Hristidis, Nishant Kapoor, S. ...
APPROX
2004
Springer
88views Algorithms» more  APPROX 2004»
15 years 9 months ago
A Stateful Implementation of a Random Function Supporting Parity Queries over Hypercubes
Abstract. Motivated by an open problem recently suggested by Goldreich et al., we study truthful implementations of a random binary function supporting compound XOR queries over su...
Andrej Bogdanov, Hoeteck Wee
ICDT
2010
ACM
147views Database» more  ICDT 2010»
15 years 7 months ago
Querying Parse Trees of Stochastic Context-Free Grammars
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
Sara Cohen, Benny Kimelfeld