2703 search results - page 427 / 541 » Optimizing memory transactions |
128
click to vote
PE
2008
Springer
15 years 3 months ago
2008
Springer
Following up on a recently renewed interest in computational methods for M/G/1-type processes, this paper considers an M/G/1-like system in which the service time distribution is ...
102
click to vote
PE
2006
Springer
15 years 3 months ago
2006
Springer
Several recent studies have proposed methods to accelerate the receipt of a file by downloading its parts from different servers in parallel. The schemes suggested in most propose...
138
Voted
AI
1999
Springer
15 years 3 months ago
1999
Springer
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
158
click to vote
PAMI
2007
15 years 2 months ago
2007
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....
121
click to vote
PR
2007
15 years 2 months ago
2007
We introduce a new graph cut for clustering which we call the Information Cut. It is derived using Parzen windowing to estimate an information theoretic distance measure between p...