6365 search results - page 342 / 1273 » Fast Local Computation Algorithms |
195
click to vote
SAC
2006
ACM
16 years 21 days ago
2006
ACM
This paper explores the generation of candidates, which is an important step in frequent itemset mining algorithms, from a theoretical point of view. Important notions in our prob...
155
click to vote
ICPR
2004
IEEE
16 years 7 months ago
2004
IEEE
This paper proposes a video-based super-resolution algorithm by high-frequency component compensation. Normalized logarithm distance (NLD) minimization on local shape feature is p...
249
click to vote
CASC
2011
Springer
14 years 6 months ago
2011
Springer
We investigate two practical divide-and-conquer style algorithms for univariate polynomial arithmetic. First we revisit an algorithm originally described by Brent and Kung for comp...
174
click to vote
EUROSYS
2010
ACM
16 years 3 months ago
2010
ACM
As organizations start to use data-intensive cluster computing systems like Hadoop and Dryad for more applications, there is a growing need to share clusters between users. Howeve...
217
click to vote
CVPR
2004
IEEE
15 years 10 months ago
2004
IEEE
We formulate face localization as a Maximum A Posteriori Probability(MAP) problem of finding the best estimation of human face configuration in a given image. The a prior distribu...