36 search results - page 5 / 8 » Algorithms for Enumerating All Perfect, Maximum and Maximal ... |
STOC
2009
ACM
14 years 8 months ago
2009
ACM
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
SIGIR
2002
ACM
13 years 7 months ago
2002
ACM
We present a novel sequential clustering algorithm which is motivated by the Information Bottleneck (IB) method. In contrast to the agglomerative IB algorithm, the new sequential ...
SIGECOM
2010
ACM
14 years 13 days ago
2010
ACM
We study the design of truthful mechanisms that do not use payments for the generalized assignment problem (GAP) and its variants. An instance of the GAP consists of a bipartite g...
3DIM
2005
IEEE
14 years 1 months ago
2005
IEEE
Automatic range image registration without any knowledge of the viewpoint requires identification of common regions across different range images and then establishing point corr...
DAM
2007
13 years 7 months ago
2007
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...