Sciweavers

4926 search results - page 366 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
LCPC
2009
Springer
15 years 9 months ago
Using the Meeting Graph Framework to Minimise Kernel Loop Unrolling for Scheduled Loops
This paper improves our previous research effort [1] by providing an efficient method for kernel loop unrolling minimisation in the case of already scheduled loops, where circular...
Mounira Bachir, David Gregg, Sid Ahmed Ali Touati
COLT
2000
Springer
15 years 9 months ago
The Computational Complexity of Densest Region Detection
We investigate the computational complexity of the task of detecting dense regions of an unknown distribution from un-labeled samples of this distribution. We introduce a formal l...
Shai Ben-David, Nadav Eiron, Hans-Ulrich Simon
ICALP
2005
Springer
15 years 10 months ago
How Well Can Primal-Dual and Local-Ratio Algorithms Perform?
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...
Allan Borodin, David Cashman, Avner Magen
141
Voted
CRV
2005
IEEE
182views Robotics» more  CRV 2005»
15 years 10 months ago
Using Vanishing Points To Correct Camera Rotation In Images
Vanishing points provide valuable information regarding the camera model used to capture an image. To explore the relationship between classes of camera models and the location of...
Andrew C. Gallagher
NN
2010
Springer
189views Neural Networks» more  NN 2010»
14 years 11 months ago
Sparse kernel learning with LASSO and Bayesian inference algorithm
Kernelized LASSO (Least Absolute Selection and Shrinkage Operator) has been investigated in two separate recent papers (Gao et al., 2008) and (Wang et al., 2007). This paper is co...
Junbin Gao, Paul W. Kwan, Daming Shi