539 search results - page 37 / 108 » Recurrence relations and fast algorithms |
101
click to vote
HPCA
2009
IEEE
16 years 2 months ago
2009
IEEE
The verification of an execution against memory consistency is known to be NP-hard. This paper proposes a novel fast memory consistency verification method by identifying a new na...
103
click to vote
ECCV
2010
Springer
15 years 7 months ago
2010
Springer
This paper presents algorithms for efficiently computing the covariance matrix for features that form sub-windows in a large multidimensional image. For example, several image proc...
106
click to vote
CVPR
2009
IEEE
15 years 8 months ago
2009
IEEE
This paper presents a fast method for detecting multi-view cars in real-world scenes. Cars are artificial objects with various appearance changes, but they have relatively consist...
104
click to vote
ASPDAC
2004
ACM
15 years 7 months ago
2004
ACM
- To minimize energy consumption by voltage scaling in design of heterogeneousreal-time embeddedsystems, it is necessary to perfom two distinct tasks: task scheduling (TS) and volt...
125
click to vote
DAGSTUHL
2006
15 years 3 months ago
2006
One of the main difficulties faced when analyzing Markov chains modelling evolutionary algorithms is that their cardinality grows quite fast. A reasonable way to deal with this iss...