Sciweavers

1362 search results - page 94 / 273
» Means, Correlations and Bounds
Sort
View
117
Voted
ICCD
2006
IEEE
137views Hardware» more  ICCD 2006»
15 years 10 months ago
Reduction of Crosstalk Pessimism using Tendency Graph Approach
— Accurate estimation of worst-case crosstalk effects is critical for a realistic estimation of the worst-case behavior of deep sub-micron circuits. Crosstalk analysis models usu...
Murthy Palla, Klaus Koch, Jens Bargfrede, Manfred ...
ALGORITHMICA
2004
111views more  ALGORITHMICA 2004»
15 years 1 months ago
Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems
We present a framework for an automated generation of exact search tree algorithms for NP-hard problems. The purpose of our approach is two-fold--rapid development and improved up...
Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Nie...
MOBIHOC
2012
ACM
13 years 4 months ago
Throughput of rateless codes over broadcast erasure channels
In this paper, we characterize the throughput of a broadcast network with n receivers using rateless codes with block size K. We assume that the underlying channel is a Markov mod...
Yang Yang, Ness B. Shroff
ISIPTA
2003
IEEE
15 years 7 months ago
Products of Capacities Derived from Additive Measures
abstract DAMJAN ˇSKULJ University of Ljubljana, Slovenia A new approach to define a product of capacities is presented. It works for capacities that are in a certain relation wi...
Damjan Skulj
118
Voted
CSR
2006
Springer
15 years 5 months ago
Complexity of Polynomial Multiplication over Finite Fields
Let Mq (n ) denote the number of multiplications required to compute the coefficients of the product of two polynomials of degree n over a q -element field by means of bilinear alg...
Michael Kaminski