3818 search results - page 311 / 764 » Word Problems on Compressed Words |
181
Voted
ALGORITHMICA
2002
15 years 6 months ago
2002
We obtain the strongest separation between quantum and classical query complexity known to date--specifically, we define a black-box problem that requires exponentially many querie...
170
click to vote
AUTOMATICA
2002
15 years 6 months ago
2002
This paper deals with the frequency domain properties of an ellipsoidal family of rational functions, i.e. a family of rational functions whose coefficients depend affinely on an ...
178
click to vote
CLIMA
2010
15 years 8 months ago
2010
Half positionality is the property of a language of infinite words to admit positional winning strategies, when interpreted as the goal of a two-player game on a graph. Such proble...
186
click to vote
CSL
2004
Springer
15 years 6 months ago
2004
Springer
Recent approaches to large vocabulary decoding with finite state graphs have focused on the use of state minimization algorithms to produce relatively compact graphs. This paper e...
151
click to vote
PC
2000
15 years 6 months ago
2000
Three parallel optimisation algorithms for use in the context of multilevel graph partitioning for unstructured meshes are described. The first, interface optimisation reduces the...