1395 search results - page 170 / 279 » Modeling betweenness for question answering |
188
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...
179
click to vote
JSYML
2007
15 years 6 months ago
2007
We investigate the complexity of various combinatorial theorems about linear and partial orders, from the points of view of computability theory and reverse mathematics. We focus ...
201
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
This paper addresses the following question: Is it possible to migrate TCP/IP flows between different networks on modern mobile devices, without infrastructure support or protocol...
111
click to vote
ICPR
2000
IEEE
16 years 7 months ago
2000
IEEE
Research has been active in thefield offorgeiy detection, but relatively little work has been done on the detection of skilled forgeries. In thispaper, we present an algorithmfor ...
167
click to vote
NIPS
2003
15 years 7 months ago
2003
We consider the question of how well a given distribution can be approximated with probabilistic graphical models. We introduce a new parameter, effective treewidth, that captures...