3818 search results - page 287 / 764 » Word Problems on Compressed Words |
164
click to vote
JMLR
2010
15 years 1 months ago
2010
We explore automated discovery of topicallycoherent segments in speech or text sequences. We give two new discriminative topic segmentation algorithms which employ a new measure o...
238
click to vote
TMM
2010
15 years 1 months ago
2010
Abstract--Unlimited vocabulary annotation of multimedia documents remains elusive despite progress solving the problem in the case of a small, fixed lexicon. Taking advantage of th...
275
click to vote
ICALP
2011
Springer
14 years 10 months ago
2011
Springer
Given an unlabeled, unweighted, and undirected graph with n vertices and small (but not necessarily constant) treewidth k, we consider the problem of preprocessing the graph to bui...
196
click to vote
ATVA
2011
Springer
14 years 6 months ago
2011
Springer
In [AKL10], we showed how viewing online algorithms as reactive systems enables the application of ideas from formal verification to the competitive analysis of online algorithms....
177
click to vote
FCT
2009
Springer
16 years 1 months ago
2009
Springer
Weighted automata are finite automata with numerical weights on transitions. Nondeterministic weighted automata define quantitative languages L that assign to each word w a real ...