Sciweavers

447 search results - page 24 / 90
» Decision trees with minimal costs
Sort
View
ICCAD
2004
IEEE
118views Hardware» more  ICCAD 2004»
14 years 5 months ago
Optimizing mode transition sequences in idle intervals for component-level and system-level energy minimization
New embedded systems offer rich power management features in the form of multiple operational and non-operational power modes. While they offer mechanisms for better energy effic...
Jinfeng Liu, Pai H. Chou
ICC
2009
IEEE
110views Communications» more  ICC 2009»
14 years 3 months ago
Delay Constrained Scheduling over Fading Channels: Optimal Policies for Monomial Energy-Cost Functions
— A point-to-point discrete-time scheduling problem of transmitting B information bits within T hard delay deadline slots is considered assuming that the underlying energy-bit co...
Juyul Lee, Nihar Jindal
SMA
2008
ACM
122views Solid Modeling» more  SMA 2008»
13 years 8 months ago
The cost of not knowing the radius
Robust Statistics considers the quality of statistical decisions in the presence of deviations from the ideal model, where deviations are modelled by neighborhoods of a certain siz...
Helmut Rieder, Matthias Kohl, Peter Ruckdeschel
MICCAI
2005
Springer
14 years 9 months ago
Automatic Vascular Tree Formation Using the Mahalanobis Distance
We present a novel technique for the automatic formation of vascular trees from segmented tubular structures. Our method combines a minimum spanning tree algorithm with a minimizat...
Julien Jomier, Vincent LeDigarcher, Stephen R. Ayl...
ALGORITHMICA
2002
94views more  ALGORITHMICA 2002»
13 years 8 months ago
The Quantum Black-Box Complexity of Majority
We describe a quantum black-box network computing the majority of N bits with zerosided error using only 2 3 N + O( N log( -1 log N)) queries: the algorithm returns the correct an...
Thomas P. Hayes, Samuel Kutin, Dieter van Melkebee...