3818 search results - page 252 / 764 » Word Problems on Compressed Words |
179
click to vote
ALGORITHMICA
2002
15 years 6 months ago
2002
It is shown that, for every strongly connected network in which every edge has capacity at least , linear time suffices to send flow from source vertices, each with a given supply,...
184
click to vote
ANOR
2002
15 years 6 months ago
2002
We present a Tabu Search (TS) method that employs a simple version of ejection chains for coloring graphs. The procedure is tested on a set of benchmark problems. Empirical result...
145
click to vote
APPML
2002
15 years 6 months ago
2002
A method for structural clustering is proposed involving data on subset-to-entity linkages that can be calculated with structural data such as graphs or sequences or images. The m...
166
click to vote
CCE
2004
15 years 6 months ago
2004
The results of experimental testing of balanced random interval arithmetic with typical mathematical test functions and practical problem are presented and discussed. The possibili...
179
click to vote
COLING
2002
15 years 6 months ago
2002
This paper describes a project tagging a spontaneous speech corpus with morphological information such as word segmentation and parts-ofspeech. We use a morphological analysis sys...