Sciweavers

2609 search results - page 89 / 522
» Optimizing for parallelism and data locality
Sort
View
ICMCS
2006
IEEE
113views Multimedia» more  ICMCS 2006»
15 years 10 months ago
On Parallelization of a Video Mining System
As digital video data becomes more pervasive, mining information from multimedia data becomes increasingly important. Although researches in multimedia mining area have shown grea...
Wenlong Li, Eric Li, Nan Di, Carole Dulong, Tao Wa...
CGF
2008
90views more  CGF 2008»
15 years 4 months ago
Visual Clustering in Parallel Coordinates
Parallel coordinates have been widely applied to visualize high-dimensional and multivariate data, discerning patterns within the data through visual clustering. However, the effe...
Hong Zhou, Xiaoru Yuan, Huamin Qu, Weiwei Cui, Bao...
ICML
2005
IEEE
16 years 5 months ago
Robust one-class clustering using hybrid global and local search
Unsupervised learning methods often involve summarizing the data using a small number of parameters. In certain domains, only a small subset of the available data is relevant for ...
Gunjan Gupta, Joydeep Ghosh
DATE
2010
IEEE
153views Hardware» more  DATE 2010»
15 years 9 months ago
Recursion-driven parallel code generation for multi-core platforms
—We present Huckleberry, a tool for automatically generating parallel implementations for multi-core platforms from sequential recursive divide-and-conquer programs. The recursiv...
Rebecca L. Collins, Bharadwaj Vellore, Luca P. Car...
PPSN
2010
Springer
15 years 3 months ago
Variable Neighborhood Search and Ant Colony Optimization for the Rooted Delay-Constrained Minimum Spanning Tree Problem
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
Mario Ruthmair, Günther R. Raidl