5624 search results - page 1011 / 1125 » On Conditional Covering Problem |
STOC
2003
ACM
14 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...
SIGMOD
2008
ACM
14 years 10 months ago
2008
ACM
A variety of web sites and web based services produce textual lists at varying time granularities ranked according to several criteria. For example, Google Trends produces lists o...
EDBT
2008
ACM
14 years 10 months ago
2008
ACM
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
ECCV
2008
Springer
14 years 8 months ago
2008
Springer
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...
CIARP
2009
Springer
14 years 4 months ago
2009
Springer
This paper gives an overview of works done in our group on 3D and appearance modeling of objects, from images. The backbone of our approach is to use what we consider as the princi...