Sciweavers

2421 search results - page 186 / 485
» Approximate Flow-Aware Networking
Sort
View
ICCAD
2003
IEEE
113views Hardware» more  ICCAD 2003»
16 years 13 days ago
Branch Merge Reduction of RLCM Networks
— In this paper we consider the problem of finding a smaller RLCM circuit that approximately replicates the behavior (up to a certain frequency) of a given RLCM circuit. Targeted...
Bernard N. Sheehan
110
Voted
CDC
2008
IEEE
144views Control Systems» more  CDC 2008»
15 years 5 months ago
Controllability decompositions of networked systems through quotient graphs
In this paper we study decentralized, networked systems whose interaction dynamics are given by a nearestneighbor averaging rule. By letting one node in the network take on the rol...
Simone Martini, Magnus Egerstedt, Antonio Bicchi
ICML
2005
IEEE
16 years 4 months ago
Learning class-discriminative dynamic Bayesian networks
In many domains, a Bayesian network's topological structure is not known a priori and must be inferred from data. This requires a scoring function to measure how well a propo...
John Burge, Terran Lane
125
Voted
ICDCS
2009
IEEE
15 years 10 months ago
Stochastic Multicast with Network Coding
The usage of network resources by content providers is commonly governed by Service Level Agreements (SLA) between the content provider and the network service provider. Resource ...
Ajay Gopinathan, Zongpeng Li
135
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
Minimum Maximum Degree Publish-Subscribe Overlay Network Design
—Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For sca...
Melih Onus, Andréa W. Richa