823 search results - page 103 / 165 » Brick partitions of graphs |
169
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
This paper investigates compression of 3D objects in computer graphics using manifold learning. Spectral compression uses the eigenvectors of the graph Laplacian of an object'...
165
click to vote
INFOCOM
2009
IEEE
16 years 25 days ago
2009
IEEE
Abstract—Many sensor network applications are tightly coupled with the geometric environment where the sensor nodes are deployed. The topological skeleton extraction has shown gr...
147
click to vote
FOCS
2008
IEEE
16 years 19 days ago
2008
IEEE
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...
171
click to vote
CIVR
2005
Springer
15 years 11 months ago
2005
Springer
This paper presents a new approach for video clip retrieval based on Earth Mover’s Distance (EMD). Instead of imposing one-to-one matching constraint as in [11, 14], our approach...
179
click to vote
COCOON
2003
Springer
15 years 11 months ago
2003
Springer
In this paper, we approach the quality of a greedy algorithm for the maximum weighted clique problem from the viewpoint of matroid theory. More precisely, we consider the clique c...