Sciweavers

1185 search results - page 131 / 237
» An Improved Parallel Thinning Algorithm
Sort
View
MICCAI
2000
Springer
15 years 1 months ago
Intraoperative Segmentation and Nonrigid Registration for Image Guided Therapy
Our goal was to improve image guidance during minimally invasive image guided therapy by developing an intraoperative segmentation and nonrigid registration algorithm. The algorith...
Simon K. Warfield, Arya Nabavi, Torsten Butz, Kema...
DAC
2001
ACM
15 years 11 months ago
High-Quality Operation Binding for Clustered VLIW Datapaths
Clustering is an effective method to increase the available parallelism in VLIW datapaths without incurring severe penalties associated with large number of register file ports. E...
Viktor S. Lapinskii, Margarida F. Jacome, Gustavo ...
WEA
2010
Springer
245views Algorithms» more  WEA 2010»
15 years 4 months ago
Contraction of Timetable Networks with Realistic Transfers
We successfully contract timetable networks with realistic transfer times. Contraction gradually removes nodes from the graph and adds shortcuts to preserve shortest paths. This r...
Robert Geisberger
FOCS
2008
IEEE
15 years 4 months ago
The Bayesian Learner is Optimal for Noisy Binary Search (and Pretty Good for Quantum as Well)
We use a Bayesian approach to optimally solve problems in noisy binary search. We deal with two variants: • Each comparison is erroneous with independent probability 1 − p. â€...
Michael Ben-Or, Avinatan Hassidim
ICANN
2009
Springer
15 years 2 months ago
Constrained Learning Vector Quantization or Relaxed k-Separability
Neural networks and other sophisticated machine learning algorithms frequently miss simple solutions that can be discovered by a more constrained learning methods. Transition from ...
Marek Grochowski, Wlodzislaw Duch