500 search results - page 83 / 100 » Approximation algorithms for maximum independent set of pseu... |
129
click to vote
PAMI
2006
15 years 1 months ago
2006
This paper describes a novel solution to the rigid point pattern matching problem in Euclidean spaces of any dimension. Although we assume rigid motion, jitter is allowed. We pres...
105
click to vote
ATMOS
2010
15 years 20 days ago
2010
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...
124
click to vote
ICIP
1995
IEEE
15 years 5 months ago
1995
IEEE
This paper develops an error bound for narrow bandwidth Gabor filters synthesized using multiple stages. It is shown that the error introduced by approximating narrow bandwidth Ga...
125
click to vote
PODC
2011
ACM
14 years 4 months ago
2011
ACM
In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model [4,9,10]. This model includes two types...
127
click to vote
SIGECOM
2009
ACM
15 years 8 months ago
2009
ACM
The monopolist’s theory of optimal single-item auctions for agents with independent private values can be summarized by two statements. The first is from Myerson [8]: the optim...