Sciweavers

277 search results - page 47 / 56
» The saga of minimum spanning trees
Sort
View
DAC
2009
ACM
15 years 4 months ago
O-Router: an optical routing framework for low power on-chip silicon nano-photonic integration
In this work, we present a new optical routing framework, O-Router for future low-power on-chip optical interconnect integration utilizing silicon compatible nano-photonic devices...
Duo Ding, Yilin Zhang, Haiyu Huang, Ray T. Chen, D...
CVPR
2006
IEEE
15 years 4 months ago
New Method of Probability Density Estimation with Application to Mutual Information Based Image Registration
We present a new, robust and computationally efficient method for estimating the probability density of the intensity values in an image. Our approach makes use of a continuous r...
Ajit Rajwade, Arunava Banerjee, Anand Rangarajan
ICDM
2006
IEEE
110views Data Mining» more  ICDM 2006»
15 years 4 months ago
Manifold Clustering of Shapes
Shape clustering can significantly facilitate the automatic labeling of objects present in image collections. For example, it could outline the existing groups of pathological ce...
Dragomir Yankov, Eamonn J. Keogh
IPPS
2002
IEEE
15 years 2 months ago
Optimizing Graph Algorithms for Improved Cache Performance
Tiling has long been used to improve cache performance. Recursion has recently been used as a cache-oblivious method of improving cache performance. Both of these techniques are n...
Joon-Sang Park, Michael Penner, Viktor K. Prasanna
STACS
2001
Springer
15 years 2 months ago
Approximation Algorithms for the Bottleneck Stretch Factor Problem
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
Giri Narasimhan, Michiel H. M. Smid