3818 search results - page 325 / 764 » Word Problems on Compressed Words |
196
click to vote
SAT
2009
Springer
16 years 1 months ago
2009
Springer
Probabilistic inference techniques can be used to estimate variable bias, or the proportion of solutions to a given SAT problem that fix a variable positively or negatively. Metho...
217
click to vote
SCIA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Level set methods are a popular way to solve the image segmentation problem in computer image analysis. A contour is implicitly represented by the zero level of a signed ...
203
click to vote
ESA
2005
Springer
16 years 7 days ago
2005
Springer
Abstract. Traditional shortest path problems play a central role in both the design and use of communication networks and have been studied extensively. In this work, we consider a...
157
click to vote
GECCO
2005
Springer
16 years 7 days ago
2005
Springer
The tagging problem in natural language processing is to find a way to label every word in a text as a particular part of speech, e.g., proper noun. An effective way of solving th...
194
click to vote
MFCS
2004
Springer
16 years 2 days ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....