Sciweavers

1066 search results - page 63 / 214
» Computing Private Set Operations with Linear Complexities
Sort
View
SDM
2009
SIAM
170views Data Mining» more  SDM 2009»
15 years 7 months ago
Mining Complex Spatio-Temporal Sequence Patterns.
Mining sequential movement patterns describing group behaviour in potentially streaming spatio-temporal data sets is a challenging problem. Movements are typically noisy and often...
Florian Verhein
APWEB
2010
Springer
15 years 1 months ago
Computing Large Skylines over Few Dimensions: The Curse of Anti-correlation
The skyline of a set P of multi-dimensional points (tuples) consists of those points in P for which no clearly better point in P exists, using component-wise comparison on domains ...
Henning Köhler, Jing Yang
GLVLSI
2010
IEEE
190views VLSI» more  GLVLSI 2010»
14 years 11 months ago
A linear statistical analysis for full-chip leakage power with spatial correlation
In this paper, we present an approved linear-time algorithm for statistical leakage analysis in the present of any spatial correlation condition (strong or weak). The new algorith...
Ruijing Shen, Sheldon X.-D. Tan, Jinjun Xiong
PODS
1994
ACM
138views Database» more  PODS 1994»
15 years 1 months ago
Dyn-FO: A Parallel, Dynamic Complexity Class
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
Sushant Patnaik, Neil Immerman
PLDI
2003
ACM
15 years 3 months ago
Compile-time dynamic voltage scaling settings: opportunities and limits
With power-related concerns becoming dominant aspects of hardware and software design, significant research effort has been devoted towards system power minimization. Among run-t...
Fen Xie, Margaret Martonosi, Sharad Malik