1538 search results - page 75 / 308 » Spectral Techniques in Graph Algorithms |
123
click to vote
STOC
2001
ACM
16 years 1 months ago
2001
ACM
Given a matrix A, it is often desirable to find a good approximation to A that has low rank. We introduce a simple technique for accelerating the computation of such approximation...
114
click to vote
NIPS
2008
15 years 2 months ago
2008
We show that an important and computationally challenging solution space feature of the graph coloring problem (COL), namely the number of clusters of solutions, can be accurately...
APVIS
2004
15 years 2 months ago
2004
The topic of skeletal animation and its associated techniques have previously been applied in the area of animating computer-generated characters for motion pictures and computer ...
127
click to vote
KRDB
2003
15 years 2 months ago
2003
The Polylog framework is designed to provide a language for efficiently automating complex queries of information represented in multiple formats. A Polylog program contains a set...
139
click to vote
SIBGRAPI
2005
IEEE
15 years 7 months ago
2005
IEEE
Tracking moving objects in video sequence is an important problem in computer vision, with applications several fields, such as video surveillance and target tracking. Most techn...