Sciweavers

427 search results - page 48 / 86
» Sequential predictions based on algorithmic complexity
Sort
View
VLSID
2002
IEEE
136views VLSI» more  VLSID 2002»
16 years 3 months ago
Buffered Routing Tree Construction under Buffer Placement Blockages
Interconnect delay has become a critical factor in determining the performance of integrated circuits. Routing and buffering are powerful means of improving the circuit speed and ...
Wei Chen, Massoud Pedram, Premal Buch
131
Voted
ICASSP
2011
IEEE
14 years 6 months ago
Video object tracking with differential Structural SIMilarity index
The Structural SIMilarity Measure (SSIM) combined with the sequential Monte Carlo approach has been shown [1] to achieve more reliable video object tracking performance, compared ...
Artur Loza, Fanglin Wang, Jie Yang, Lyudmila Mihay...
124
Voted
ICVS
2009
Springer
15 years 9 months ago
GPU-Accelerated Nearest Neighbor Search for 3D Registration
Abstract. Nearest Neighbor Search (NNS) is employed by many computer vision algorithms. The computational complexity is large and constitutes a challenge for real-time capability. ...
Deyuan Qiu, Stefan May, Andreas Nüchter
134
Voted
IJHPCA
2007
114views more  IJHPCA 2007»
15 years 2 months ago
An Approach To Data Distributions in Chapel
A key characteristic of today’s high performance computing systems is a physically distributed memory, which makes the efficient management of locality essential for taking adv...
R. E. Diaconescu, Hans P. Zima
179
Voted
WWW
2010
ACM
15 years 9 months ago
Factorizing personalized Markov chains for next-basket recommendation
Recommender systems are an important component of many websites. Two of the most popular approaches are based on matrix factorization (MF) and Markov chains (MC). MF methods learn...
Steffen Rendle, Christoph Freudenthaler, Lars Schm...