Sciweavers

779 search results - page 98 / 156
» Determining Time of Queries for Re-ranking Search Results
Sort
View
WWW
2003
ACM
16 years 6 months ago
Monitoring the dynamic web to respond to continuous queries
Continuous queries are queries for which responses given to users must be continuously updated, as the sources of interest get updated. Such queries occur, for instance, during on...
Sandeep Pandey, Krithi Ramamritham, Soumen Chakrab...
MOBIHOC
2006
ACM
16 years 5 months ago
Fundamental scaling laws for energy-efficient storage and querying in wireless sensor networks
We use a constrained optimization framework to derive fundamental scaling laws for both unstructured sensor networks (which use blind sequential search for querying) and structure...
Joon Ahn, Bhaskar Krishnamachari
SIGMOD
2009
ACM
190views Database» more  SIGMOD 2009»
16 years 6 months ago
DataLens: making a good first impression
When a database query has a large number of results, the user can only be shown one page of results at a time. One popular approach is to rank results such that the "best&quo...
Bin Liu, H. V. Jagadish
ACNS
2004
Springer
220views Cryptology» more  ACNS 2004»
15 years 11 months ago
Secure Conjunctive Keyword Search over Encrypted Data
Abstract. We study the setting in which a user stores encrypted documents (e.g. e-mails) on an untrusted server. In order to retrieve documents satisfying a certain search criterio...
Philippe Golle, Jessica Staddon, Brent R. Waters
SIGMOD
2003
ACM
152views Database» more  SIGMOD 2003»
16 years 6 months ago
Using Sets of Feature Vectors for Similarity Search on Voxelized CAD Objects
In modern application domains such as multimedia, molecular biology and medical imaging, similarity search in database systems is becoming an increasingly important task. Especial...
Hans-Peter Kriegel, Stefan Brecheisen, Peer Kr&oum...