Sciweavers

107 search results - page 14 / 22
» Some Applications of Bounds for Designs to the Cryptography
Sort
View
TAMC
2007
Springer
14 years 25 days ago
Kernelizations for Parameterized Counting Problems
Abstract. Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems,...
Marc Thurley
NEUROSCIENCE
2001
Springer
13 years 11 months ago
Analysis and Synthesis of Agents That Learn from Distributed Dynamic Data Sources
We propose a theoretical framework for specification and analysis of a class of learning problems that arise in open-ended environments that contain multiple, distributed, dynamic...
Doina Caragea, Adrian Silvescu, Vasant Honavar
DATE
2005
IEEE
117views Hardware» more  DATE 2005»
14 years 10 days ago
A Quality-of-Service Mechanism for Interconnection Networks in System-on-Chips
As Moore’s Law continues to fuel the ability to build ever increasingly complex system-on-chips (SoCs), achieving performance goals is rising as a critical challenge to completi...
Wolf-Dietrich Weber, Joe Chou, Ian Swarbrick, Drew...
ECRTS
2007
IEEE
14 years 1 months ago
On Dominating Set Allocation Policies in Real-Time Wide-Area Distributed Systems
This paper investigates resource allocation policies for achieving real-time content distribution with subsecond delay bounds on the current Internet. Resource allocation in real-...
Chengdu Huang, Tarek F. Abdelzaher, Xue Liu
DATE
2002
IEEE
131views Hardware» more  DATE 2002»
13 years 11 months ago
Passive Constrained Rational Approximation Algorithm Using Nevanlinna-Pick Interpolation
As system integration evolves and tighter design constraints must be met, it becomes necessary to account for the non-ideal behavior of all the elements in a system. For high-spee...
Carlos P. Coelho, Luis Miguel Silveira, Joel R. Ph...