Sciweavers

4004 search results - page 2 / 801
» How Many Packets Can We Encode
Sort
View
3DPVT
2006
IEEE
162views Visualization» more  3DPVT 2006»
14 years 1 months ago
How Far Can We Go with Local Optimization in Real-Time Stereo Matching
Applications such as robot navigation and augmented reality require high-accuracy dense disparity maps in real-time and online. Due to time constraint, most realtime stereo applic...
Liang Wang, Mingwei Gong, Minglun Gong, Ruigang Ya...
STACS
1999
Springer
13 years 11 months ago
In How Many Steps the k Peg Version of the Towers of Hanoi Game Can Be Solved?
Abstract. In this we paper we consider the version of the classical Towers of Hanoi games where the game-board contains more than three pegs. For k pegs we give a 2Ckn1/(k−2) low...
Mario Szegedy
PRICAI
2010
Springer
13 years 5 months ago
Towards Artificial Systems: What Can We Learn from Human Perception?
Research in learning algorithms and sensor hardware has led to rapid advances in artificial systems over the past decade. However, their performance continues to fall short of the ...
Heinrich H. Bülthoff, Lewis L. Chuang
ADAEUROPE
2008
Springer
14 years 1 months ago
Can We Increase the Usability of Real Time Scheduling Theory? The Cheddar Project
The Cheddar project deals with real time scheduling theory. Many industrial projects do not perform performance analysis with real time scheduling theory even if the demand for the...
Frank Singhoff, Alain Plantec, Pierre Dissaux
ECAI
2004
Springer
13 years 11 months ago
Many Hands Make Light Work: Localized Satisfiability for Multi-Context Systems
In this paper, we tackle the satisfiability problem for multi-context systems. First, we establish a satisfiability algorithm based on an encoding into propositional logic. Then, w...
Floris Roelofsen, Luciano Serafini, Alessandro Cim...