Sciweavers

1147 search results - page 63 / 230
» Statistical Timing Analysis Using Bounds
Sort
View
RECOMB
2000
Springer
14 years 14 days ago
Sequencing-by-hybridization at the information-theory bound: an optimal algorithm
In a recent paper (Preparata et al., 1999) we introduced a novel probing scheme for DNA sequencing by hybridization (SBH). The new gapped-probe scheme combines natural and univers...
Franco P. Preparata, Eli Upfal
CISS
2008
IEEE
14 years 3 months ago
On optimal training and beamforming in uncorrelated MIMO systems with feedback
—This paper studies the design and analysis of optimal training-based beamforming in uncorrelated multipleinput multiple-output (MIMO) channels with known Gaussian statistics. Fi...
Francisco Rubio, Dongning Guo, Michael L. Honig, X...
COLT
2010
Springer
13 years 7 months ago
Robust Selective Sampling from Single and Multiple Teachers
We present a new online learning algorithm in the selective sampling framework, where labels must be actively queried before they are revealed. We prove bounds on the regret of ou...
Ofer Dekel, Claudio Gentile, Karthik Sridharan
ECRTS
2007
IEEE
14 years 3 months ago
A Delay Composition Theorem for Real-Time Pipelines
Uniprocessor schedulability theory made great strides, in part, due to the simplicity of composing the delay of a job from the execution times of higher-priority jobs that preempt...
Praveen Jayachandran, Tarek F. Abdelzaher
PODC
2005
ACM
14 years 2 months ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer