Sciweavers

2924 search results - page 356 / 585
» Lower Bounds in Distributed Computing
Sort
View
TVLSI
2008
133views more  TVLSI 2008»
15 years 4 months ago
Test Data Compression Using Selective Encoding of Scan Slices
We present a selective encoding method that reduces test data volume and test application time for scan testing of Intellectual Property (IP) cores. This method encodes the slices ...
Zhanglei Wang, Krishnendu Chakrabarty
COMCOM
2000
96views more  COMCOM 2000»
15 years 4 months ago
A routing algorithm for dynamic multicast trees with end-to-end path length control
The new Path Length Control (PLC) algorithm establishes and maintains multicast trees which maximize the bandwidth to be shared by multiple receivers and which satisfy the maximum...
Hiroshi Fujinoki, Kenneth J. Christensen
CORR
2010
Springer
96views Education» more  CORR 2010»
15 years 3 months ago
Rate-distortion function via minimum mean square error estimation
Abstract—We derive a simple general parametric representation of the rate–distortion function of a memoryless source, where both the rate and the distortion are given by integr...
Neri Merhav
152
Voted
MA
2010
Springer
132views Communications» more  MA 2010»
15 years 3 months ago
Model selection by sequentially normalized least squares
Model selection by the predictive least squares (PLS) principle has been thoroughly studied in the context of regression model selection and autoregressive (AR) model order estima...
Jorma Rissanen, Teemu Roos, Petri Myllymäki
171
Voted
COLT
2010
Springer
15 years 2 months ago
Regret Minimization With Concept Drift
In standard online learning, the goal of the learner is to maintain an average loss that is "not too big" compared to the loss of the best-performing function in a fixed...
Koby Crammer, Yishay Mansour, Eyal Even-Dar, Jenni...