Sciweavers

1890 search results - page 320 / 378
» Querying Big Data by Accessing Small Data
Sort
View
117
Voted
ASIAN
2004
Springer
180views Algorithms» more  ASIAN 2004»
15 years 4 months ago
Counting by Coin Tossings
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
Philippe Flajolet
91
Voted
PVLDB
2008
110views more  PVLDB 2008»
14 years 10 months ago
Online maintenance of very large random samples on flash storage
Recent advances in flash media have made it an attractive alternative for data storage in a wide spectrum of computing devices, such as embedded sensors, mobile phones, PDA's...
Suman Nath, Phillip B. Gibbons
VLDB
1992
ACM
151views Database» more  VLDB 1992»
15 years 3 months ago
Parallelism in a Main-Memory DBMS: The Performance of PRISMA/DB
This paper evaluates the performance of the parallel, main-memory DBMS, PRISMA/DB. First, an architecture for parallel query execution is presented. A performance model for the ex...
Annita N. Wilschut, Jan Flokstra, Peter M. G. Aper...
SIGIR
2010
ACM
15 years 2 months ago
Context-aware ranking in web search
The context of a search query often provides a search engine meaningful hints for answering the current query better. Previous studies on context-aware search were either focused ...
Biao Xiang, Daxin Jiang, Jian Pei, Xiaohui Sun, En...
SDM
2004
SIAM
174views Data Mining» more  SDM 2004»
15 years 13 days ago
Classifying Documents Without Labels
Automatic classification of documents is an important area of research with many applications in the fields of document searching, forensics and others. Methods to perform classif...
Daniel Barbará, Carlotta Domeniconi, Ning K...