3630 search results - page 269 / 726 » How to Compare Treebanks |
198
click to vote
ADBIS
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. In this paper we provide a theoretical framework for estimating the size of the intersection join between two line segment datasets (e.g., roads, railways, utilities). Fo...
196
click to vote
GLVLSI
1999
IEEE
15 years 11 months ago
1999
IEEE
Despite the seemingly endless upwards spiral of modern VLSI technology, many experts are predicting a hard wall for CMOS in about a decade. Given this, researchers continue to loo...
209
click to vote
AUSAI
1999
Springer
15 years 11 months ago
1999
Springer
In previous work solutions for the nesting problem are produced using the no fit polygon (NFP), a new evaluation method and three evolutionary algorithms (simulated annealing (SA),...
206
click to vote
CPM
1999
Springer
15 years 11 months ago
1999
Springer
We present a new indexing method for the approximate string matching problem. The method is based on a su x tree combined with a partitioning of the pattern. We analyze the resulti...
179
click to vote
ER
1999
Springer
15 years 11 months ago
1999
Springer
During the process of updating a database, two interrelated problems could arise. On one hand, when an update is applied to the database, integrity constraints could become violat...