Sciweavers

6317 search results - page 1129 / 1264
» System Support for Pervasive Applications
Sort
View
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
16 years 4 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang
PODS
2008
ACM
250views Database» more  PODS 2008»
16 years 4 months ago
Approximating predicates and expressive queries on probabilistic databases
We study complexity and approximation of queries in an expressive query language for probabilistic databases. The language studied supports the compositional use of confidence com...
Christoph Koch
ICSE
2005
IEEE-ACM
16 years 4 months ago
An empirical study of fault localization for end-user programmers
End users develop more software than any other group of programmers, using software authoring devices such as e-mail filtering editors, by-demonstration macro builders, and spread...
Joseph R. Ruthruff, Margaret M. Burnett, Gregg Rot...
EUROSYS
2007
ACM
16 years 1 months ago
STMBench7: a benchmark for software transactional memory
Software transactional memory (STM) is a promising technique for controlling concurrency in modern multi-processor architectures. STM aims to be more scalable than explicit coarse...
Rachid Guerraoui, Michal Kapalka, Jan Vitek
WWW
2010
ACM
15 years 11 months ago
TWC data-gov corpus: incrementally generating linked government data from data.gov
The Open Government Directive is making US government data available via websites such as Data.gov for public access. In this paper, we present a Semantic Web based approach that ...
Li Ding, Dominic DiFranzo, Alvaro Graves, James Mi...
« Prev « First page 1129 / 1264 Last » Next »