3630 search results - page 541 / 726 » Fast Marching Methods |
135
click to vote
DAC
1996
ACM
15 years 10 months ago
1996
ACM
Iterative-improvement 2-way min-cut partitioning is an important phase in most circuit partitioning tools. Most iterative improvement techniques for circuit netlists like the Fidd...
167
click to vote
ACMICEC
2007
ACM
15 years 10 months ago
2007
ACM
Bids during an online auction arrive at unequally-spaced discrete time points. Our goal is to capture the entire continuous price-evolution function by representing it as a functi...
205
click to vote
CPM
2006
Springer
15 years 10 months ago
2006
Springer
The Range-Minimum-Query-Problem is to preprocess an array such that the position of the minimum element between two specified indices can be obtained efficiently. We present a dire...
161
click to vote
DAS
2006
Springer
15 years 10 months ago
2006
Springer
In this paper, a reliable and efficient structural analysis method for mathematical formulae is proposed for practical mathematical OCR. The proposed method consists of three steps...
178
click to vote
DILS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Grid computing has great potential for supporting the integration of complex, fast changing biological data repositories to enable distributed data analysis. One scenario...