3875 search results - page 262 / 775 » Approximation algorithms for the 0-extension problem |
218
click to vote
PDCAT
2005
Springer
16 years 6 days ago
2005
Springer
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
181
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...
290
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
223
click to vote
PG
2007
IEEE
16 years 1 months ago
2007
IEEE
Developable surfaces have many desired properties in manufacturing process. Since most existing CAD systems utilize parametric surfaces as the design primitive, there is a great d...
160
click to vote
WSC
2004
15 years 8 months ago
2004
In time-parallel simulation, the simulation time axis is decomposed into a number of slices which are assigned to parallel processes for concurrent simulation. Although a promisin...