393 search results - page 17 / 79 » The LCA Problem Revisited |
116
click to vote
AIL
2002
15 years 1 months ago
2002
: In this paper I recapitulate the ideas of Berman and Hafner (1993) regarding the role of teleology in legal argument. I show how these ideas can be used to address some issues ar...
108
click to vote
NAACL
2010
14 years 11 months ago
2010
Understanding query ambiguity in web search remains an important open problem. In this paper we reexamine query ambiguity by analyzing the result clickthrough data. Previously pro...
104
click to vote
TSP
2010
14 years 8 months ago
2010
The problem of identification of quasi-periodically varying dynamic systems is considered. This problem can be solved using generalized adaptive notch filtering (GANF) algorithms. ...
141
Voted
ILP
2004
Springer
15 years 7 months ago
2004
Springer
For the last ten years a lot of work has been devoted to propositionalization techniques in relational learning. These techniques change the representation of relational problems t...
140
Voted
AI
2010
Springer
15 years 2 months ago
2010
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...