Sciweavers

2092 search results - page 49 / 419
» A Theory of Non-Deterministic Networks
Sort
View
JMLR
2012
13 years 5 days ago
Detecting Network Cliques with Radon Basis Pursuit
In this paper, we propose a novel formulation of the network clique detection problem by introducing a general network data representation framework. We show connections between o...
Xiaoye Jiang, Yuan Yao, Han Liu, Leonidas J. Guiba...
CORR
2010
Springer
137views Education» more  CORR 2010»
14 years 9 months ago
Open Graphs and Monoidal Theories
String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. The distinguishing feature of...
Lucas Dixon, Aleks Kissinger
JSAC
2011
100views more  JSAC 2011»
14 years 18 days ago
Scheduling for Optimal Rate Allocation in Ad Hoc Networks With Heterogeneous Delay Constraints
—This paper studies the problem of scheduling in single-hop wireless networks with real-time traffic, where every packet arrival has an associated deadline and a minimum fractio...
Juan José Jaramillo, R. Srikant, Lei Ying
INFOCOM
2009
IEEE
15 years 4 months ago
Packet Classification Algorithms: From Theory to Practice
—During the past decade, the packet classification problem has been widely studied to accelerate network applications such as access control, traffic engineering and intrusion de...
Yaxuan Qi, Lianghong Xu, Baohua Yang, Yibo Xue, Ju...
NETWORKS
2010
14 years 8 months ago
Optical index of fault tolerant routings in WDM networks
Maˇnuch and Stacho [7] introduced the problem of designing f-tolerant routings in optical networks, i.e., routings which still satisfy the given requests even if f failures occur...
Stéphane Bessy, Clément Lepelletier