489 search results - page 87 / 98 » Approximation Algorithms for the Minimum-Length Corridor and... |
137
Voted
CORR
2006
Springer
15 years 3 months ago
2006
Springer
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay...
146
Voted
COCO
2005
Springer
15 years 9 months ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
114
Voted
DCC
2004
IEEE
16 years 3 months ago
2004
IEEE
In the discrete filtering problem, a data sequence over a finite alphabet is assumed to be corrupted by a discrete memoryless channel. The goal is to reconstruct the clean sequenc...
137
Voted
INFOCOM
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract— The Internet connectivity in the Autonomous System (AS) level reflects the commercial relationship between ASes. A connection between two ASes could be of type custome...
163
Voted
CVPR
2009
IEEE
16 years 10 months ago
2009
IEEE
We describe an algorithm for similar-image search which
is designed to be efficient for extremely large collections of
images. For each query, a small response set is selected by...