2912 search results - page 244 / 583 » Logistic Model Trees |
140
Voted
COLING
2008
15 years 7 months ago
2008
We introduce a new type of discourse constraints for the interaction of discourse relations with the configuration of discourse segments. We examine corpus-extracted examples as s...
174
click to vote
UAI
2001
15 years 7 months ago
2001
We introduce a compact graph-theoretic representation for multi-party game theory. Our main result is a provably correct and efficient algorithm for computing approximate Nash equ...
132
click to vote
ACL
1998
15 years 7 months ago
1998
In this paper, we propose a generalization of Centering Theory (CT) (Grosz, Joshi, Weinstein 1995) called Veins Theory (VT), which extends the applicability of centering rules fro...
147
Voted
IPPS
2005
IEEE
15 years 11 months ago
2005
IEEE
The problem of scheduling independent tasks on heterogeneous trees is considered. The nodes of the tree may have different processing times, and links different communication time...
128
click to vote
ESA
2003
Springer
15 years 11 months ago
2003
Springer
We present a new finger search tree with O(1) worst-case update time and O(log log d) expected search time with high probability in the Random Access Machine (RAM) model of comput...