4865 search results - page 188 / 973 » The Complexity of Graph Connectivity |
112
Voted
IJCAI
1997
15 years 5 months ago
1997
This paper studies constraint satisfaction over connected row-convex (CRC) constraints. It shows that CRC constraints are closed under composition, intersection, and transposition...
165
click to vote
NIPS
1993
15 years 5 months ago
1993
The non-linear complexities of neural networks make network solutions difficult to understand. Sanger's contribution analysis is here extended to the analysis of networks aut...
120
click to vote
CN
2004
15 years 3 months ago
2004
Network service providers purchase large point-to-point connections from network owners, then offer individual users network access at a price. Appropriately provisioning (purchas...
145
click to vote
EVOW
2008
Springer
15 years 5 months ago
2008
Springer
Advances in modern technologies for measuring protein-protein interaction (PPI) has boosted research in PPI networks analysis and comparison. One of the challenging problems in com...
189
click to vote
CSR
2011
Springer
14 years 7 months ago
2011
Springer
The Goldreich’s function has n binary inputs and n binary outputs. Every output depends on d inputs and is computed from them by the fixed predicate of arity d. Every Goldreich...