7380 search results - page 293 / 1476 » time 2008 |
180
Voted
CCCG
2008
15 years 8 months ago
2008
Given a set of n points P = {p1, p2, . . . , pn} in the plane, we show how to preprocess P such that for any query line segment L we can report in O(log n) time the smallest enclo...
156
click to vote
UAI
2003
15 years 8 months ago
2003
Symbolic representations have been used successfully in off-line planning algorithms for Markov decision processes. We show that they can also improve the performance of online p...
144
click to vote
COLING
1990
15 years 7 months ago
1990
This paper describes two novel techniques which, when applied together, in practice significantly reduce the time required for unifying disjunctive feature structures. The first i...
155
click to vote
TELE
2008
15 years 6 months ago
2008
This study examines the ``medium-centric'' and ``user-centric'' approaches in investigating the displacement effects of the Internet. Results from a random sam...
173
click to vote
WSC
2008
15 years 9 months ago
2008
A typical wafer fab requires numerous decisions for daily operations. Even small decisions on system configurations may have significant impact on the overall fab performance. One...