2095 search results - page 144 / 419 » Improved pebbling bounds |
159
click to vote
RTSS
2005
IEEE
16 years 1 days ago
2005
IEEE
This paper focuses on the hierarchical scheduling of systems where a number of separate applications reside on a single processor. It addresses the particular case where fixed pri...
152
click to vote
FCT
2005
Springer
16 years 1 hour ago
2005
Springer
We present an algorithm which calculates a minimum cut and its weight in an undirected graph with nonnegative real edge weights, n vertices and m edges, in time O( ` max (log n, mi...
198
click to vote
COMPGEOM
1995
ACM
15 years 10 months ago
1995
ACM
We present a simple but powerful new probabilistic technique for analyzing the combinatorial complexity of various substructures in arrangements of piecewise-linear surfaces in hig...
198
click to vote
ICML
2010
IEEE
15 years 4 months ago
2010
IEEE
Online learning algorithms have recently risen to prominence due to their strong theoretical guarantees and an increasing number of practical applications for large-scale data ana...
189
click to vote
STOC
2006
ACM
16 years 6 months ago
2006
ACM
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...