283 search results - page 53 / 57 » Bounds on the Generalization Performance of Kernel Machine E... |
EUROSYS
2011
ACM
12 years 10 months ago
2011
ACM
Symmetric multiprocessing (SMP) virtual machines (VMs) allow users to take advantage of a multiprocessor infrastructure. Despite the advantage, SMP VMs can cause synchronization l...
DAGM
2010
Springer
13 years 8 months ago
2010
Springer
Density modeling is notoriously difficult for high dimensional data. One approach to the problem is to search for a lower dimensional manifold which captures the main characteristi...
COLT
2005
Springer
13 years 9 months ago
2005
Springer
External regret compares the performance of an online algorithm, selecting among N actions, to the performance of the best of those actions in hindsight. Internal regret compares ...
SPAA
2006
ACM
14 years 1 months ago
2006
ACM
Suppose we have a parallel or distributed system whose nodes have limited capacities, such as processing speed, bandwidth, memory, or disk space. How does the performance of the s...
SPAA
2003
ACM
14 years 17 days ago
2003
ACM
We develop an algorithm for parallel disk sorting, whose I/O cost approaches the lower bound and that guarantees almost perfect overlap between I/O and computation. Previous algor...