778 search results - page 46 / 156 » Bounding Smooth Integers |
WCET
2003
14 years 11 months ago
2003
Worst-Case Execution Time (WCET) analysis means to compute a safe upper bound to the execution time of a piece of code. Parametric WCET analysis yields symbolic upper bounds: expr...
SODA
2004
ACM
14 years 11 months ago
2004
ACM
We close the gaps between known lower and upper bounds for the online partial-sums problem in the RAM and group models of computation. If elements are chosen from an abstract grou...
89
Voted
STOC
2009
ACM
15 years 10 months ago
2009
ACM
The price of anarchy (POA) is a worst-case measure of the inefficiency of selfish behavior, defined as the ratio of the objective function value of a worst Nash equilibrium of a g...
CORR
2010
Springer
14 years 7 months ago
2010
Springer
We present a method for proving upper bounds on the eigenvalues of the graph Laplacian. A main step involves choosing an appropriate "Riemannian" metric to uniformize th...
67
Voted
ICCV
2009
IEEE
16 years 3 months ago
2009
IEEE
User-provided object bounding box is a simple and
popular interaction paradigm considered by many existing
interactive image segmentation frameworks. However,
these frameworks t...