Sciweavers

1299 search results - page 168 / 260
» Computing Minimal Diagnoses with Critical Set Algorithms
Sort
View
SIGMOD
2010
ACM
186views Database» more  SIGMOD 2010»
15 years 11 months ago
Fast approximate correlation for massive time-series data
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
Abdullah Mueen, Suman Nath, Jie Liu
CVPR
2007
IEEE
16 years 8 months ago
Integrating Global and Local Structures: A Least Squares Framework for Dimensionality Reduction
Linear Discriminant Analysis (LDA) is a popular statistical approach for dimensionality reduction. LDA captures the global geometric structure of the data by simultaneously maximi...
Jianhui Chen, Jieping Ye, Qi Li
CVPR
2008
IEEE
16 years 8 months ago
Globally optimal shape-based tracking in real-time
Most algorithms for real-time tracking of deformable shapes provide sub-optimal solutions for a suitable energy minimization task: The search space is typically considered too lar...
Thomas Schoenemann, Daniel Cremers
SOFSEM
2010
Springer
16 years 3 months ago
Parallel Randomized Load Balancing: A Lower Bound for a More General Model
We extend the lower bound of Adler et. al [1] and Berenbrink [3] for parallel randomized load balancing algorithms. The setting in these asynchronous and distributed algorithms is...
Guy Even, Moti Medina
MFCS
2009
Springer
16 years 1 months ago
Query Automata for Nested Words
We study visibly pushdown automata (VPA) models for expressing and evaluating queries, expressed using MSO formulas, on words with a nesting structure (like XML documents). We deļ...
P. Madhusudan, Mahesh Viswanathan