7380 search results - page 253 / 1476 » time 2008 |
177
click to vote
ICONIP
2008
15 years 8 months ago
2008
Abstract. A method is proposed to determine the similarity of a collection of time series. As a first step, one extracts events from the time series, in other words, one converts e...
167
click to vote
UAI
1990
15 years 7 months ago
1990
The intelligent reformulation or restructuring of a belief network can greatly increase the efficiency of inference. However, time expended for reformulation is not available for ...
202
click to vote
ALGORITHMICA
2008
15 years 6 months ago
2008
We present exact algorithms with exponential running times for variants of n-element set cover problems, based on divide-and-conquer and on inclusion
169
click to vote
QUESTA
2008
15 years 6 months ago
2008
Consider an M/G/c queue with homogeneous servers and service time distribution F. It is shown that an approximation of the service time distribution F by stochastically smaller di...
160
click to vote
CCCG
2008
15 years 8 months ago
2008
An algorithm for computing the maximum area empty isothetic orthoconvex polygon among a set of n points in a rectangular region, is presented. The worst case time and space comple...