1421 search results - page 83 / 285 » Algorithms for subsequence combinatorics |
112
click to vote
COLING
2010
14 years 11 months ago
2010
Text Understanding systems often commit to a single best interpretation of a sentence before analyzing subsequent text. This interpretation is chosen by resolving ambiguous altern...
133
click to vote
MOBIHOC
2007
ACM
16 years 3 months ago
2007
ACM
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We p...
126
Voted
TALG
2008
15 years 4 months ago
2008
The Tower of Hanoi problem is generalized by placing pegs on the vertices of a given directed graph G with two distinguished vertices, S and D, and allowing moves only along arcs o...
121
click to vote
HIPC
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Parallelizing a sequential algorithm—i.e., manually or automatically converting it into an equivalent parallel distributed algorithm—is an important problem. Ideally,...
166
click to vote
ICMLA
2003
15 years 5 months ago
2003
– Discretization is a process of converting a continuous attribute into an attribute that contains small number of distinct values. One of the major reasons for discretizing an a...