505 search results - page 18 / 101 » On the Minimality and Decomposability of Constraint Networks |
126
click to vote
COMCOM
2006
15 years 6 months ago
2006
In this paper, for the purpose of saving network resources, we first introduce and investigate a new problem referred to as the least hop(s) multiple additively constrained path (...
193
click to vote
ASPDAC
2010
ACM
15 years 4 months ago
2010
ACM
As Double Patterning Lithography(DPL) becomes the leading candidate for sub-30nm lithography process, we need a fast and lithography friendly decomposition framework. In this pape...
131
click to vote
ICANN
2007
Springer
16 years 6 days ago
2007
Springer
The hierarchical non-negative matrix factorization (HNMF) is a multilayer generative network for decomposing strictly positive data into strictly positive activations and base vect...
169
click to vote
INFOCOM
2006
IEEE
16 years 2 days ago
2006
IEEE
— In this paper we consider the problem of query and search in a network, e.g., searching for a specific node or a piece of data. We limit our attention to the class of TTL (tim...
154
click to vote
INFOCOM
2009
IEEE
16 years 21 days ago
2009
IEEE
— In this paper, we study the problem of multi-path routing with bandwidth and delay constraints, which arises in applications for video delivery over bandwidth-limited networks....