Sciweavers

5230 search results - page 37 / 1046
» Dynamic Optimality -- Almost
Sort
View
CORR
2010
Springer
53views Education» more  CORR 2010»
13 years 11 months ago
Prequential Plug-In Codes that Achieve Optimal Redundancy Rates even if the Model is Wrong
We analyse the prequential plug-in codes relative to one-parameter exponential families M. We show that if data are sampled i.i.d. from some distribution outside M, then the redund...
Peter Grünwald, Wojciech Kotlowski
SIGMETRICS
2008
ACM
118views Hardware» more  SIGMETRICS 2008»
13 years 11 months ago
Finding the optimal quantum size: Sensitivity analysis of the M/G/1 round-robin queue
We consider the round robin (RR) scheduling policy where the server processes each job in its buffer for at most a fixed quantum, q, in a round-robin fashion. The processor sharin...
Varun Gupta
JNW
2007
112views more  JNW 2007»
13 years 11 months ago
A Multi-Commodity Flow Model for Optimal Routing in Wireless MESH Networks
— We propose a mathematical programming model of the routing problem in multi-hop wireless networks that takes into account quality of service requirements considering bandwidth ...
Antonio Capone, Fabio Martignon
GLVLSI
2002
IEEE
122views VLSI» more  GLVLSI 2002»
14 years 3 months ago
A compact delay model for series-connected MOSFETs
A compact delay model for series connected MOSFETs has been derived. This model enables accurate prediction of worst-case delay of different logic families such as dynamic logic. ...
Kaveh Shakeri, James D. Meindl
FOCS
2006
IEEE
14 years 5 months ago
Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions
We present an algorithm for the c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time of O(dn1/c2 +o(1) ) and space O(dn + n1+1/c2 +o(1) ...
Alexandr Andoni, Piotr Indyk