Sciweavers

2925 search results - page 514 / 585
» Information Complexity of Online Problems
Sort
View
STOC
2007
ACM
101views Algorithms» more  STOC 2007»
14 years 10 months ago
Toward a general theory of quantum games
We study properties of quantum strategies, which are complete specifications of a given party's actions in any multiple-round interaction involving the exchange of quantum in...
Gus Gutoski, John Watrous
ICIP
2009
IEEE
14 years 8 months ago
On the Use of Color Appearance Modeling for Efficient Compressed-Domain Image Enhancement
In this paper we propose a compressed-domain image enhancement algorithm based on color appearance modeling. We aim at providing an efficient high-quality JPEG color image enhancem...
Maria Chatzigiorgaki, Athanassios N. Skodras
EUROSYS
2007
ACM
14 years 7 months ago
Fine grained kernel logging with KLogger: experience and insights
Understanding the detailed behavior of an operating system is crucial for making informed design decisions. But such an understanding is very hard to achieve, due to the increasin...
Yoav Etsion, Dan Tsafrir, Scott Kirkpatrick, Dror ...
ICRA
2009
IEEE
107views Robotics» more  ICRA 2009»
14 years 4 months ago
Autonomous driving in a multi-level parking structure
— Recently, the problem of autonomous navigation of automobiles has gained substantial interest in the robotics community. Especially during the two recent DARPA grand challenges...
Rainer Kümmerle, Dirk Hähnel, Dmitri Dol...
CPAIOR
2009
Springer
14 years 4 months ago
Learning How to Propagate Using Random Probing
Abstract. In constraint programming there are often many choices regarding the propagation method to be used on the constraints of a problem. However, simple constraint solvers usu...
Efstathios Stamatatos, Kostas Stergiou