1195 search results - page 74 / 239 » What, Where |
APPROX
2010
Springer
13 years 10 months ago
2010
Springer
We consider the question: What is the maximum flow achievable in a network if the flow must be decomposable into a collection of edgedisjoint paths? Equivalently, we wish to find a...
DLT
2008
13 years 10 months ago
2008
By the famous theorem of Morse and Hedlund, a word is ultimately periodic if and only if it has bounded subword complexity, i.e., for sufficiently large n, the number of factors of...
RIAO
2007
13 years 10 months ago
2007
Focussed XML component retrieval is one of the most important challenges in the XML IR field. The aim of the focussed retrieval strategy is to find the most exhaustive and specifi...
ALENEX
2004
13 years 10 months ago
2004
There are numerous instances where mathematical constants do not admit a closed form. It is then of great interest to compute them, possibly in an efficient way. So the question i...
DMIN
2006
13 years 10 months ago
2006
- Filtering the immense amount of data available electronically over the World Wide Web is an important task of search engines in data mining applications. Users when performing se...