Sciweavers

581 search results - page 71 / 117
» Fast Hierarchical Clustering Based on Compressed Data
Sort
View
IPPS
2009
IEEE
14 years 2 months ago
High-order stencil computations on multicore clusters
Stencil computation (SC) is of critical importance for broad scientific and engineering applications. However, it is a challenge to optimize complex, highorder SC on emerging clus...
Liu Peng, Richard Seymour, Ken-ichi Nomura, Rajiv ...
ICCV
2007
IEEE
14 years 2 months ago
Fast Matching of Planar Shapes in Sub-cubic Runtime
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...
Frank R. Schmidt, Dirk Farin, Daniel Cremers
SDM
2004
SIAM
212views Data Mining» more  SDM 2004»
13 years 9 months ago
Clustering with Bregman Divergences
A wide variety of distortion functions, such as squared Euclidean distance, Mahalanobis distance, Itakura-Saito distance and relative entropy, have been used for clustering. In th...
Arindam Banerjee, Srujana Merugu, Inderjit S. Dhil...
WSC
2004
13 years 9 months ago
Simulation-Based Advanced WIP Management and Control in Semiconductor Manufacturing
We develop a hierarchical distributed production planning and control methodology, called DISCS, for a large and unstable semiconductor manufacturing process. The upper layer of D...
Kazuo Miyashita, Tsukasa Okazaki, Hirofumi Matsuo
ICNP
1999
IEEE
14 years 10 hour ago
Dynamic Memory Model Based Framework for Optimization of IP Address Lookup Algorithms
The design of software-based algorithms for fast IP address lookup targeted for general purpose processors has received tremendous attention in recent years due to its low cost im...
Gene Cheung, Steven McCanne