Sciweavers

70 search results - page 13 / 14
» Minimizing average flow-time under knapsack constraint
Sort
View
PR
2006
83views more  PR 2006»
13 years 9 months ago
Optimal convex error estimators for classification
A cross-validation error estimator is obtained by repeatedly leaving out some data points, deriving classifiers on the remaining points, computing errors for these classifiers on ...
Chao Sima, Edward R. Dougherty
CORR
2011
Springer
210views Education» more  CORR 2011»
13 years 1 months ago
Transmission with Energy Harvesting Nodes in Fading Wireless Channels: Optimal Policies
Wireless systems comprised of rechargeable nodes have a significantly prolonged lifetime and are sustainable. A distinct characteristic of these systems is the fact that the node...
Omur Ozel, Kaya Tutuncuoglu, Jing Yang, Sennur Ulu...
CORR
2007
Springer
124views Education» more  CORR 2007»
13 years 9 months ago
Anonymous Networking amidst Eavesdroppers
—The problem of security against packet timing based traffic analysis in wireless networks is considered in this work. An analytical measure of “anonymity” of routes in eave...
Parvathinathan Venkitasubramaniam, Ting He, Lang T...
SPAA
2003
ACM
14 years 3 months ago
Short length menger's theorem and reliable optical routing
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman
CASES
2004
ACM
14 years 3 months ago
Procedure placement using temporal-ordering information: dealing with code size expansion
Abstract— In a direct-mapped instruction cache, all instructions that have the same memory address modulo the cache size, share a common and unique cache slot. Instruction cache ...
Christophe Guillon, Fabrice Rastello, Thierry Bida...