1225 search results - page 108 / 245 » The Instance Complexity Conjecture |
124
click to vote
AAAI
2007
15 years 5 months ago
2007
Consistencies are properties of Constraint Networks (CNs) that can be exploited in order to make inferences. When a significant amount of such inferences can be performed, CNs ar...
124
click to vote
SDM
2010
SIAM
15 years 4 months ago
2010
SIAM
A relational probability tree (RPT) is a type of decision tree that can be used for probabilistic classification of instances with a relational structure. Each leaf of an RPT cont...
124
click to vote
LREC
2008
15 years 4 months ago
2008
Automated extraction of ontological knowledge from text corpora is a relevant task in Natural Language Processing. In this paper, we focus on the problem of finding hypernyms for ...
119
click to vote
RECSYS
2010
ACM
15 years 3 months ago
2010
ACM
Since the development of the comparably simple neighborhood-based methods in the 1990s, a plethora of techniques has been developed to improve various aspects of collaborative fil...
112
click to vote
FGCS
2006
15 years 2 months ago
2006
This work introduces a method for instrumenting applications, producing execution traces, and visualizing multiple trace instances to identify performance features. The approach p...