Sciweavers

2924 search results - page 539 / 585
» Lower Bounds in Distributed Computing
Sort
View
ICDE
2010
IEEE
219views Database» more  ICDE 2010»
14 years 7 months ago
PIP: A Database System for Great and Small Expectations
Estimation via sampling out of highly selective join queries is well known to be problematic, most notably in online aggregation. Without goal-directed sampling strategies, samples...
Oliver Kennedy, Christoph Koch
CCGRID
2009
IEEE
14 years 2 months ago
Markov Model Based Disk Power Management for Data Intensive Workloads
—In order to meet the increasing demands of present and upcoming data-intensive computer applications, there has been a major shift in the disk subsystem, which now consists of m...
Rajat Garg, Seung Woo Son, Mahmut T. Kandemir, Pad...
CEAS
2006
Springer
13 years 11 months ago
Fast Uncertainty Sampling for Labeling Large E-mail Corpora
One of the biggest challenges in building effective anti-spam solutions is designing systems to defend against the everevolving bag of tricks spammers use to defeat them. Because ...
Richard Segal, Ted Markowitz, William Arnold
PODS
2003
ACM
113views Database» more  PODS 2003»
14 years 7 months ago
Materializing views with minimal size to answer queries
In this paper we study the following problem. Given a database and a set of queries, we want to find, in advance, a set of views that can compute the answers to the queries, such ...
Rada Chirkova, Chen Li
MOBIHOC
2001
ACM
14 years 7 months ago
Geometric spanner for routing in mobile networks
We propose a new routing graph, the Restricted Delaunay Graph (RDG), for ad hoc networks. Combined with a node clustering algorithm, RDG can be used as an underlying graph for geo...
Jie Gao, Leonidas J. Guibas, John Hershberger, Li ...