Sciweavers

9359 search results - page 168 / 1872
» Generalization Algorithms for Second-Order Terms
Sort
View
JACM
1998
88views more  JACM 1998»
15 years 4 months ago
A Threshold of ln n for Approximating Set Cover
Given a collection Ᏺ of subsets of S ϭ {1, . . . , n}, set cover is the problem of selecting as few as possible subsets from Ᏺ such that their union covers S, and max k-cover ...
Uriel Feige
CORR
2012
Springer
202views Education» more  CORR 2012»
14 years 5 days ago
Mining Flipping Correlations from Large Datasets with Taxonomies
In this paper we introduce a new type of pattern – a flipping correlation pattern. The flipping patterns are obtained from contrasting the correlations between items at diffe...
Marina Barsky, Sangkyum Kim, Tim Weninger, Jiawei ...
EDBT
2008
ACM
135views Database» more  EDBT 2008»
16 years 4 months ago
Minimizing latency and memory in DSMS: a unified approach to quasi-optimal scheduling
Data Stream Management Systems (DSMSs) must support optimized execution scheduling of multiple continuous queries on massive, and frequently bursty, data streams. Previous approac...
Yijian Bai, Carlo Zaniolo
MOBIHOC
2007
ACM
16 years 4 months ago
Complexity in geometric SINR
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We p...
Olga Goussevskaia, Yvonne Anne Oswald, Roger Watte...
ACMSE
2009
ACM
15 years 11 months ago
A hybrid approach to mining frequent sequential patterns
The mining of frequent sequential patterns has been a hot and well studied area—under the broad umbrella of research known as KDD (Knowledge Discovery and Data Mining)— for we...
Erich Allen Peterson, Peiyi Tang