3270 search results - page 186 / 654 » Approximate String Processing |
144
click to vote
STOC
2010
ACM
15 years 7 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
122
Voted
KDD
2000
ACM
15 years 6 months ago
2000
ACM
Information extraction is one of the most important techniques used in Text Mining. One of the main problems in building information extraction (IE) systems is that the knowledge ...
124
Voted
SIGMETRICS
2010
ACM
15 years 1 months ago
2010
ACM
We introduce and analyze a deterministic fluid model that serves as an approximation for the Gt/GI/st + GI manyserver queueing model, which has a general time-varying arrival pro...
117
click to vote
ICCS
2001
Springer
15 years 7 months ago
2001
Springer
Nowadays, people start to accept fuzzy rule–based systems as flexible and convenient tools to solve a myriad of ill–defined but otherwise (for humans) straightforward tasks s...
124
Voted
IWANN
1999
Springer
15 years 7 months ago
1999
Springer
To avoid the curse of dimensionality, function approximators are used in reinforcement learning to learn value functions for individual states. In order to make better use of comp...