4095 search results - page 242 / 819 » How to test a tree |
117
click to vote
ICLP
2010
Springer
15 years 4 months ago
2010
Springer
ProbLog is a probabilistic framework that extends Prolog with probabilistic facts. To compute the probability of a query, the complete SLD proof tree of the query is collected as a...
147
click to vote
DASFAA
2004
IEEE
15 years 4 months ago
2004
IEEE
Relational index structures, as for instance the Relational Interval Tree or the Linear Quadtree, support efficient processing of queries on top of existing object-relational datab...
98
Voted
LREC
2010
15 years 2 months ago
2010
We investigate Arabic Context Free Grammar parsing with dependency annotation comparing lexicalised and unlexicalised parsers. We study how morphosyntactic as well as function tag...
81
Voted
IJCAI
2007
15 years 2 months ago
2007
Mechanism design is the study of preference aggregation protocols that work well in the face of self-interested agents. We present the first general-purpose techniques for automa...
153
click to vote
UAI
2008
15 years 2 months ago
2008
Numerous temporal inference tasks such as fault monitoring and anomaly detection exhibit a persistence property: for example, if something breaks, it stays broken until an interve...