Sciweavers

3415 search results - page 137 / 683
» Lower Bounds for Kernelizations
Sort
View
SPAA
1994
ACM
15 years 8 months ago
Bounds on the Greedy Routing Algorithm for Array Networks
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
Michael Mitzenmacher
AMC
2008
82views more  AMC 2008»
15 years 4 months ago
Parameter estimation error bounds for Hammerstein nonlinear finite impulsive response models
This paper presents a parameter estimation algorithm for a class of Hammerstein nonlinear systems
Li Yu, Jiabo Zhang, Yuwu Liao, Jie Ding
DM
2006
70views more  DM 2006»
15 years 4 months ago
Improving probability bounds by optimization over subsets
The simple device of maximization over subsets of events can provide substantial improvement over the Dawson
Fred M. Hoppe
ICPR
2010
IEEE
15 years 11 months ago
A Bound on the Performance of LDA in Randomly Projected Data Spaces
We consider the problem of classification in nonadaptive dimensionality reduction. Specifically, we bound the increase in classification error of Fisher’s Linear Discriminant...
Robert John Durrant, Ata Kaban
CORR
2010
Springer
111views Education» more  CORR 2010»
15 years 4 months ago
A Tight Bound on the Performance of a Minimal-Delay Joint Source-Channel Coding Scheme
An analog source is to be transmitted across a Gaussian channel in more than one channel use per source symbol. This paper derives a lower bound on the asymptotic mean squared erro...
Marius Kleiner, Bixio Rimoldi