Sciweavers

1208 search results - page 132 / 242
» Uniform eventown problems
Sort
View
ICALP
2011
Springer
14 years 1 months ago
Clique Clustering Yields a PTAS for max-Coloring Interval Graphs
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
Tim Nonner
KDD
2004
ACM
154views Data Mining» more  KDD 2004»
15 years 10 months ago
Diagnosing extrapolation: tree-based density estimation
There has historically been very little concern with extrapolation in Machine Learning, yet extrapolation can be critical to diagnose. Predictor functions are almost always learne...
Giles Hooker
STOC
2006
ACM
108views Algorithms» more  STOC 2006»
15 years 10 months ago
Extractors for a constant number of polynomially small min-entropy independent sources
We consider the problem of randomness extraction from independent sources. We construct an extractor that can extract from a constant number of independent sources of length n, ea...
Anup Rao
ICST
2009
IEEE
15 years 4 months ago
Optimizing Probabilities of Real-Time Test Case Execution
—Model-based test derivation for real-time system has been proven to be a hard problem for exhaustive test suites. Therefore, techniques for real-time testing do not aim to exhau...
Nicolás Wolovick, Pedro R. D'Argenio, Hongy...
VLDB
1997
ACM
78views Database» more  VLDB 1997»
15 years 2 months ago
Recovering Information from Summary Data
Data is often stored in summarized form, as a histogram of aggregates (COUNTs, SUMs, or AVeraGes) over speci ed ranges. We study how to estimate the original detail data from the ...
Christos Faloutsos, H. V. Jagadish, Nikolaos Sidir...