Sciweavers

3471 search results - page 626 / 695
» Data Stream Query Processing
Sort
View
FAST
2004
15 years 18 days ago
Diamond: A Storage Architecture for Early Discard in Interactive Search
This paper explores the concept of early discard for interactive search of unindexed data. Processing data inside storage devices using downloaded searchlet code enables Diamond t...
Larry Huston, Rahul Sukthankar, Rajiv Wickremesing...
IHI
2010
173views Healthcare» more  IHI 2010»
14 years 6 months ago
Towards large-scale sharing of electronic health records of cancer patients
The rising cost of healthcare is one of the major concerns faced by the nation. One way to lower healthcare costs and provide better quality care to patients is through the effect...
Praveen R. Rao, Stanley A. Edlavitch, Jeffrey L. H...
WWW
2005
ACM
15 years 12 months ago
LSH forest: self-tuning indexes for similarity search
We consider the problem of indexing high-dimensional data for answering (approximate) similarity-search queries. Similarity indexes prove to be important in a wide variety of sett...
Mayank Bawa, Tyson Condie, Prasanna Ganesan
KDD
2009
ACM
227views Data Mining» more  KDD 2009»
15 years 11 months ago
Efficiently learning the accuracy of labeling sources for selective sampling
Many scalable data mining tasks rely on active learning to provide the most useful accurately labeled instances. However, what if there are multiple labeling sources (`oracles...
Pinar Donmez, Jaime G. Carbonell, Jeff Schneider
VLDB
2007
ACM
155views Database» more  VLDB 2007»
15 years 11 months ago
Towards Graph Containment Search and Indexing
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
Chen Chen, Xifeng Yan, Philip S. Yu, Jiawei Han, D...