Sciweavers

4926 search results - page 352 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
HPCC
2005
Springer
15 years 10 months ago
A Threshold-Based Matching Algorithm for Photonic Clos Network Switches
This study concerns a threshold-based matching algorithm for Clos (t-MAC) network switches. The studied Clos network uses a central photonic switch fabric for transporting high-spe...
Ding-Jyh Tsaur, Chi-Feng Tang, Chin-Chi Wu, Woei L...
CVPR
2004
IEEE
16 years 6 months ago
Spatially Coherent Clustering Using Graph Cuts
Feature space clustering is a popular approach to image segmentation, in which a feature vector of local properties (such as intensity, texture or motion) is computed at each pixe...
Ramin Zabih, Vladimir Kolmogorov
ISBI
2004
IEEE
16 years 5 months ago
Model Based Symmetric Information Theoretic Large Deformation Multi-Modal Image Registration
This paper presents a Bayesian framework for generating inverse-consistent inter-subject large deformation transformations between two multi-modal image sets of the brain. In this...
Peter Lorenzen, Brad Davis, Sarang C. Joshi
IPPS
1997
IEEE
15 years 9 months ago
Work-Time Optimal K-Merge Algorithms on the PRAM
The k-merge problem, given a collection of k, (2  k  n), sorted sequences of total length n, asks to merge them into a new sorted sequence. The main contribution of this work is...
Tatsuya Hayashi, Koji Nakano, Stephan Olariu
143
Voted
ICRA
2009
IEEE
126views Robotics» more  ICRA 2009»
15 years 2 months ago
Time-bounded lattice for efficient planning in dynamic environments
For vehicles navigating initially unknown cluttered environments, current state-of-the-art planning algorithms are able to plan and re-plan dynamically-feasible paths efficiently a...
Aleksandr Kushleyev, Maxim Likhachev