Sciweavers

220 search results - page 10 / 44
» Minimizing Average Flow-time : Upper and Lower Bounds
Sort
View
SIGMOD
2012
ACM
210views Database» more  SIGMOD 2012»
11 years 9 months ago
Interactive regret minimization
We study the notion of regret ratio proposed in [19] to deal with multi-criteria decision making in database systems. The regret minimization query proposed in [19] was shown to h...
Danupon Nanongkai, Ashwin Lall, Atish Das Sarma, K...
ISCAS
2006
IEEE
104views Hardware» more  ISCAS 2006»
14 years 22 days ago
Average lengths of wire routing under M-architecture and X-architecture
— The X-architecture is a new integrated-circuit wiring technique in the physical design. Compared with the currently used M-architecture, which uses either horizontal or vertica...
S. P. Shang, Xiaodong Hu, Tong Jing
ICC
2009
IEEE
161views Communications» more  ICC 2009»
14 years 1 months ago
Linear MMSE MIMO Channel Estimation with Imperfect Channel Covariance Information
—In this paper, we investigate the effects of imperfect knowledge of the channel covariance matrix on the performance of a linear minimum mean-square-error (MMSE) estimator for m...
Antonio Assalini, Emiliano Dall'Anese, Silvano Pup...
APVIS
2008
13 years 8 months ago
Crossing Minimization meets Simultaneous Drawing
We define the concept of crossing numbers for simultaneous graphs by extending the crossing number problem of traditional graphs. We discuss differences to the traditional crossin...
Markus Chimani, Michael Jünger, Michael Schul...
DAM
2008
81views more  DAM 2008»
13 years 6 months ago
Random-order bin packing
ct The average case analysis of algorithms usually assumes independent, identical distributions for the inputs. In [?], Kenyon introduced the random-order ratio, a new average case...
Edward G. Coffman Jr., János Csirik, Lajos ...