Sciweavers

15494 search results - page 173 / 3099
» Computing dynamic clusters
Sort
View
123
Voted
ICPR
2008
IEEE
15 years 11 months ago
Multi-stage branch-and-bound for maximum variance disparity clustering
A split-and-merge framework based on a maximum variance criterion is proposed for disparity clustering. The proposed algorithm transforms low-level stereo disparity information to...
Ninad Thakoor, Venkat Devarajan, Jean Gao
153
Voted
CLUSTER
2001
IEEE
15 years 8 months ago
Numerically-Intensive "Plug-and-Play" Parallel Computing
At UCLA's Plasma Physics Group, we have been successful in building and using a numerically-intensive parallel computing cluster using Power Macintosh hardware and the Macint...
Dean E. Dauger, Viktor K. Decyk
124
Voted
CLUSTER
2007
IEEE
15 years 9 months ago
A feasibility analysis of power-awareness and energy minimization in modern interconnects for high-performance computing
High-performance computing (HPC) systems consume a significant amount of power, resulting in high operational costs, reduced reliability, and wasting of natural resources. Therefor...
Reza Zamani, Ahmad Afsahi, Ying Qian, V. Carl Hama...
136
Voted
WIDM
2004
ACM
15 years 10 months ago
Web personalization based on static information and dynamic user behavior
The explosive growth of the web is at the basis of the great interest into web usage mining techniques in both commercial and research areas. In this paper, a web personalization ...
Massimiliano Albanese, Antonio Picariello, Carlo S...
CP
2010
Springer
15 years 3 months ago
Towards Parallel Non Serial Dynamic Programming for Solving Hard Weighted CSP
We introduce a parallelized version of tree-decomposition based dynamic programming for solving difficult weighted CSP instances on many cores. A tree decomposition organizes cost ...
David Allouche, Simon de Givry, Thomas Schiex