2168 search results - page 129 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
131
click to vote
STOC
2007
ACM
16 years 4 months ago
2007
ACM
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
169
click to vote
AMDO
2008
Springer
15 years 6 months ago
2008
Springer
This paper presents a framework for view-invariant action recognition in image sequences. Feature-based human detection becomes extremely challenging when the agent is being observ...
159
click to vote
ICPR
2006
IEEE
16 years 5 months ago
2006
IEEE
We propose a classification method based on a decision tree whose nodes consist of linear Support Vector Machines (SVMs). Each node defines a decision hyperplane that classifies p...
126
click to vote
ICCAD
2003
IEEE
16 years 26 days ago
2003
IEEE
Modeling and simulating pipelined processors in procedural languages such as C/C++ requires lots of cost in handling concurrent events, which hinders fast simulation. A number of ...
119
click to vote
PVM
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Manually tuning MPI runtime parameters is a practice commonly employed to optimise MPI application performance on a specific architecture. However, the best setting for ...