4843 search results - page 891 / 969 » The Shortcut Problem - Complexity and Approximation |
STOC
2003
ACM
15 years 10 months ago
2003
ACM
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...
156
click to vote
VLDB
2008
ACM
15 years 10 months ago
2008
ACM
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
DCC
2004
IEEE
15 years 9 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...
MICCAI
2009
Springer
15 years 7 months ago
2009
Springer
In this paper we present a novel method for performing image registration of different modalities. Mutual Information (MI) is an established method for performing such registration...
EUROSYS
2006
ACM
15 years 7 months ago
2006
ACM
Building content-based search tools for feature-rich data has been a challenging problem because feature-rich data such as audio recordings, digital images, and sensor data are in...