2850 search results - page 243 / 570 » Answering Queries using Humans, Algorithms and Databases |
137
Voted
ESA
2010
Springer
15 years 5 months ago
2010
Springer
As sensor networks increase in size and number, efficient techniques are required to process the very large data sets that they generate. Frequently, sensor networks monitor object...
125
click to vote
DASFAA
2009
IEEE
15 years 10 months ago
2009
IEEE
Existing xml query pattern-based caching strategies focus on extracting the set of frequently issued query pattern trees (qpt) based on the support of the qpts in the history. Thes...
114
Voted
GCB
1997
Springer
15 years 8 months ago
1997
Springer
Motivation: Database search programs such as FASTA, BLAST or a rigorous Smith–Waterman algorithm produce lists of database entries, which are assumed to be related to the query....
125
click to vote
STOC
2002
ACM
16 years 4 months ago
2002
ACM
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
202
click to vote
SIGMOD
2008
ACM
16 years 4 months ago
2008
ACM
Today's enterprise databases are large and complex, often relating hundreds of entities. Enabling ordinary users to query such databases and derive value from them has been o...