9818 search results - page 1903 / 1964 » Much Support and More |
159
click to vote
AAAI
1994
15 years 7 months ago
1994
In this paper, we study the problem of achieving efficient interaction in a distributed scheduling system whose scheduling agents may borrow resources from one another. Specifical...
170
click to vote
COLING
1996
15 years 7 months ago
1996
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
179
click to vote
AAAI
1990
15 years 7 months ago
1990
This session will explore the reasons for the lack of impact in four important areas in which AI has been expected to significantly affect real world Software Engineering. The pan...
184
click to vote
NIPS
1990
15 years 7 months ago
1990
A new class of data structures called "bumptrees" is described. These structures are useful for efficiently implementing a number of neural network related operations. A...
198
click to vote
TRECVID
2007
15 years 7 months ago
2007
This paper describes our experiments for the high level feature extraction task in TRECVid 2007. We submitted the following five runs: • A jr1 1: Baseline run using early fusio...