Sciweavers

151 search results - page 14 / 31
» Online Square Packing
Sort
View
INFOCOM
2011
IEEE
14 years 1 months ago
Consolidating virtual machines with dynamic bandwidth demand in data centers
—Recent advances in virtualization technology have made it a common practice to consolidate virtual machines(VMs) into a fewer number of servers. An efficient consolidation sche...
Meng Wang, Xiaoqiao Meng, Li Zhang 0002
KDD
2012
ACM
292views Data Mining» more  KDD 2012»
13 years 2 days ago
Online allocation of display ads with smooth delivery
Display ads on the Internet are often sold in bundles of thousands or millions of impressions over a particular time period, typically weeks or months. Ad serving systems that ass...
Anand Bhalgat, Jon Feldman, Vahab S. Mirrokni
WSCG
2003
139views more  WSCG 2003»
14 years 11 months ago
Online Accelerated Rendering of Visual Hulls in Real Scenes
This paper presents an online system which is capable of reconstructing and rendering dynamic objects in real scenes. We reconstruct visual hulls of the objects by using a shape-f...
Ming Li, Marcus A. Magnor, Hans-Peter Seidel
72
Voted
IEICET
2006
55views more  IEICET 2006»
14 years 9 months ago
Inserting Points Uniformly at Every Instance
A problem of arranging n points as uniformly as possible, which is equivalent to that of packing n equal and non-overlapping circles in a unit square, is frequently asked. In this ...
Sachio Teramoto, Tetsuo Asano, Naoki Katoh, Benjam...
JMLR
2012
13 years 2 days ago
Beyond Logarithmic Bounds in Online Learning
We prove logarithmic regret bounds that depend on the loss L∗ T of the competitor rather than on the number T of time steps. In the general online convex optimization setting, o...
Francesco Orabona, Nicolò Cesa-Bianchi, Cla...