1022 search results - page 37 / 205 » New models and algorithms for programmable networks |
172
click to vote
SBCCI
2003
ACM
15 years 11 months ago
2003
ACM
Network on Chip (NoC) is a new paradigm for designing core based System on Chips. It supports high degree of reusability and is scalable. In this paper, an efficient Two-Step Gene...
156
click to vote
SPDP
1991
IEEE
15 years 9 months ago
1991
IEEE
This paper develops two new algorithms for solving a finite constraint satisfaction problem (FCSP) in parallel. In particular, we give a parallel algorithm for the EREW PRAM model...
154
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We consider a class of learning problems that involve a structured sparsityinducing norm defined as the sum of -norms over groups of variables. Whereas a lot of effort has been pu...
135
click to vote
IPPS
2009
IEEE
16 years 20 days ago
2009
IEEE
Abstract—In this paper we consider the problem of constructing minimal cycle-breaking sets of turns for graphs that model communication networks, as a method to prevent deadlocks...
164
click to vote
CORR
2010
Springer
15 years 29 days ago
2010
Springer
Abstract: Transactional network data can be thought of as a list of oneto-many communications (e.g., email) between nodes in a social network. Most social network models convert th...