2883 search results - page 308 / 577 » Algorithms for merged indexes |
143
click to vote
FSTTCS
2006
Springer
15 years 9 months ago
2006
Springer
The boundary labeling problem was recently introduced in [5] as a response to the problem of labeling dense point sets with large labels. In boundary labeling, we are given a recta...
165
click to vote
DAC
1995
ACM
15 years 9 months ago
1995
ACM
We study the minimum-costbounded-skewrouting tree (BST) problem under the linear delay model. This problem captures several engineering tradeoffs in the design of routing topologi...
197
click to vote
ICDAR
1995
IEEE
15 years 9 months ago
1995
IEEE
We describe a new approach for evaluating page segmentation algorithms. Unlike techniques that rely on OCR output, our method is region-based: the segmentation output, described a...
151
click to vote
SIGMOD
1997
ACM
15 years 9 months ago
1997
ACM
The Partitioned Based Spatial-Merge Join (PBSM) of Patel and DeWitt and the Size Separation Spatial Join (S3 J) of Koudas and Sevcik are considered to be among the most efficient ...
139
click to vote
EVOW
2010
Springer
15 years 9 months ago
2010
Springer
A challenging problem in bioinformatics is the detection of residues that account for protein function specificity, not only in order to gain deeper insight in the nature of functi...