3818 search results - page 271 / 764 » Word Problems on Compressed Words |
164
click to vote
IANDC
2006
15 years 6 months ago
2006
Dynamic Programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic program...
160
click to vote
JUCS
2008
15 years 6 months ago
2008
: Implementing binary methods in traditional object-oriented languages is difficult: numerous problems arise regarding the relationship between types and classes in the context of ...
147
Voted
JMLR
2006
15 years 6 months ago
2006
We present a simple and scalable algorithm for maximum-margin estimation of structured output models, including an important class of Markov networks and combinatorial models. We ...
162
click to vote
ENTCS
2007
15 years 6 months ago
2007
We present a syntactic scheme for translating future-time LTL bounded model checking problems into propositional satisfiability problems. The scheme is similar in principle to th...
170
click to vote
MOR
2008
15 years 6 months ago
2008
We prove that if two smooth manifolds intersect transversally, then the method of alternating projections converges locally at a linear rate. We bound the speed of convergence in ...