Sciweavers

835 search results - page 38 / 167
» Adaptive Bound Optimization for Online Convex Optimization
Sort
View
IPPS
2000
IEEE
14 years 3 months ago
Optimal on Demand Packet Scheduling in Single-Hop Multichannel Communication Systems
In this paper, we study the problem of on demand minimum length packet scheduling in single-hop multichannel systems. Examples of these systems are those centered around switching...
Maurizio A. Bonuccelli, Susanna Pelagatti
CIDU
2010
13 years 8 months ago
Optimal Partitions of Data In Higher Dimensions
Given any collection of data cells in a data space X, consider the problem of finding the optimal partition of the data cells into blocks which are unions of cells. The algorithms...
Bradley W. Jackson, Jeffrey D. Scargle, Chris Cusa...
ASAP
2008
IEEE
105views Hardware» more  ASAP 2008»
14 years 19 days ago
Fast custom instruction identification by convex subgraph enumeration
Automatic generation of custom instruction processors from high-level application descriptions enables fast design space exploration, while offering very favorable performance and...
Kubilay Atasu, Oskar Mencer, Wayne Luk, Can C. &Ou...
TIT
2008
109views more  TIT 2008»
13 years 10 months ago
Statistical Analysis of Bayes Optimal Subset Ranking
Abstract--The ranking problem has become increasingly important in modern applications of statistical methods in automated decision making systems. In particular, we consider a for...
David Cossock, Tong Zhang
MOC
2000
76views more  MOC 2000»
13 years 10 months ago
Optimal approximation of stochastic differential equations by adaptive step-size control
We study the pathwise (strong) approximation of scalar stochastic differential equations with respect to the global error in the L2-norm. For equations with additive noise we estab...
Norbert Hofmann, Thomas Müller-Gronbach, Klau...