3630 search results - page 541 / 726 » Fast Marching Methods |
100
Voted
DAC
1996
ACM
15 years 7 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...
133
Voted
ACMICEC
2007
ACM
15 years 7 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...
151
Voted
CPM
2006
Springer
15 years 7 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...
127
Voted
DAS
2006
Springer
15 years 7 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...
136
Voted
DILS
2006
Springer
15 years 7 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...