1290 search results - page 245 / 258 » Popular Matchings: Structure and Algorithms |
144
click to vote
APPROX
2010
Springer
15 years 7 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...
152
click to vote
TVCG
2008
15 years 5 months ago
2008
Computing smooth and optimal one-to-one maps between surfaces of same topology is a fundamental problem in graphics and such a method provides us a ubiquitous tool for geometric mo...
172
click to vote
SIAMSC
2010
15 years 20 days ago
2010
In this paper we present HUND, a hypergraph-based unsymmetric nested dissection ordering algorithm for reducing the fill-in incurred during Gaussian elimination. HUND has several i...
200
click to vote
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
Significant research has been devoted to detecting people
in images and videos. In this paper we describe a human detection
method that augments widely used edge-based features
...
261
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
Supporting ranking queries in database systems has been a popular research topic recently. However, there is a lack of study on supporting ranking queries in data warehouses where...