Sciweavers

438 search results - page 76 / 88
» A Theory of Competitive Analysis for Distributed Algorithms
Sort
View
KDD
2007
ACM
153views Data Mining» more  KDD 2007»
14 years 7 months ago
Exploiting duality in summarization with deterministic guarantees
Summarization is an important task in data mining. A major challenge over the past years has been the efficient construction of fixed-space synopses that provide a deterministic q...
Panagiotis Karras, Dimitris Sacharidis, Nikos Mamo...
GECCO
2005
Springer
102views Optimization» more  GECCO 2005»
14 years 27 days ago
Latent variable crossover for k-tablet structures and its application to lens design problems
This paper presents the Real-coded Genetic Algorithms for high-dimensional ill-scaled structures, what is called, the ktablet structure. The k-tablet structure is the landscape th...
Jun Sakuma, Shigenobu Kobayashi
ICDT
2012
ACM
251views Database» more  ICDT 2012»
11 years 9 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich
SIGMOD
2008
ACM
162views Database» more  SIGMOD 2008»
14 years 7 months ago
Event queries on correlated probabilistic streams
A major problem in detecting events in streams of data is that the data can be imprecise (e.g. RFID data). However, current state-ofthe-art event detection systems such as Cayuga ...
Christopher Ré, Dan Suciu, Julie Letchner, ...
STOC
2010
ACM
204views Algorithms» more  STOC 2010»
14 years 5 days ago
Interactive privacy via the median mechanism
We define a new interactive differentially private mechanism — the median mechanism — for answering arbitrary predicate queries that arrive online. Given fixed accuracy and...
Aaron Roth, Tim Roughgarden