Sciweavers

6365 search results - page 28 / 1273
» Fast Local Computation Algorithms
Sort
View
CVBIA
2005
Springer
15 years 3 months ago
Local or Global Minima: Flexible Dual-Front Active Contours
Most variational active contour models are designed to find the “desirable” local minima of data-dependent energy functionals with the hope of avoiding undesirable configurat...
Hua Li, Anthony J. Yezzi
RECOMB
2008
Springer
15 years 10 months ago
A Fast, Alignment-Free, Conservation-Based Method for Transcription Factor Binding Site Discovery
As an increasing number of eukaryotic genomes are being sequenced, comparative studies aimed at detecting regulatory elements in intergenic sequences are becoming more prevalent. M...
Raluca Gordân, Leelavati Narlikar, Alexander...
ASPDAC
2007
ACM
110views Hardware» more  ASPDAC 2007»
15 years 1 months ago
Fast Placement Optimization of Power Supply Pads
Power grid networks in VLSI circuits are required to provide adequate input supply to ensure reliable performance. In this paper, we propose algorithms to find the placement of pow...
Yu Zhong, Martin D. F. Wong
IJCAI
2003
14 years 11 months ago
DP-SLAM: Fast, Robust Simultaneous Localization and Mapping Without Predetermined Landmarks
We present a novel, laser range finder based algorithm for simultaneous localization and mapping (SLAM) for mobile robots. SLAM addresses the problem of constructing an accurate ...
Austin I. Eliazar, Ronald Parr