1055 search results - page 114 / 211 » Enumerations in computable structure theory |
192
click to vote
COLT
1994
Springer
15 years 8 months ago
1994
Springer
Inductive Logic Programming (ILP) involves the construction of first-order definite clause theories from examples and background knowledge. Unlike both traditional Machine Learnin...
173
click to vote
IUI
2006
ACM
15 years 10 months ago
2006
ACM
Studying the relationship between natural language and affective information as well as assessing the underpinned affective qualities of natural language are becoming crucial for ...
140
click to vote
JACM
2000
15 years 4 months ago
2000
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
140
click to vote
ACL
2012
13 years 6 months ago
2012
This paper describes a novel approach towards the empirical approximation of discourse relations between different utterances in texts. Following the idea that every pair of event...
136
click to vote
COMPGEOM
2004
ACM
15 years 9 months ago
2004
ACM
The computation of Delaunay triangulations from static point sets has been extensively studied in computational geometry. When the points move with known trajectories, kinetic dat...