2466 search results - page 376 / 494 » Algorithms for distributed functional monitoring |
APPROX
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
101
Voted
KDD
2004
ACM
16 years 1 months ago
2004
ACM
Data cube pre-computation is an important concept for supporting OLAP(Online Analytical Processing) and has been studied extensively. It is often not feasible to compute a complet...
101
click to vote
FOCS
2006
IEEE
15 years 6 months ago
2006
IEEE
We study compression that preserves the solution to an instance of a problem rather than preserving the instance itself. Our focus is on the compressibility of NP decision problem...
105
Voted
CVPR
2008
IEEE
16 years 2 months ago
2008
IEEE
Many applications in computer vision and pattern recognition involve drawing inferences on certain manifoldvalued parameters. In order to develop accurate inference algorithms on ...
109
Voted
ICCV
2007
IEEE
16 years 2 months ago
2007
IEEE
Most existing subspace analysis-based tracking algorithms utilize a flattened vector to represent a target, resulting in a high dimensional data learning problem. Recently, subspa...