1254 search results - page 90 / 251 » Making Hard Problems Harder |
109
Voted
DAC
2009
ACM
15 years 4 months ago
2009
ACM
The Synchronous Dataflow (SDF) model of computation is popular for modelling the timing behaviour of real-time embedded hardware and software systems and applications. It is an es...
100
click to vote
CIKM
2006
Springer
15 years 4 months ago
2006
Springer
In practical classification, there is often a mix of learnable and unlearnable classes and only a classifier above a minimum performance threshold can be deployed. This problem is...
97
Voted
AAAI
2007
15 years 3 months ago
2007
Finding the exact treewidth of a graph is central to many operations in a variety of areas, including probabilistic reasoning and constraint satisfaction. Treewidth can be found b...
129
click to vote
ATAL
2008
Springer
15 years 2 months ago
2008
Springer
Multiagent environments are often highly dynamic and only partially observable which makes deliberative action planning computationally hard. In many such environments, however, a...
134
Voted
ECCV
2006
Springer
15 years 2 months ago
2006
Springer
This paper presents a fully automatic and highly robust head tracking algorithm based on the latest advances in real-time multi-view face detection techniques and multiple cues fus...