4865 search results - page 391 / 973 » The Complexity of Graph Connectivity |
159
click to vote
ICC
2008
IEEE
16 years 1 months ago
2008
IEEE
— Low-Density Parity-Check (LDPC) codes are typically characterized by a relatively high-complexity description, since a considerable amount of memory is required in order to sto...
198
Voted
ICCCN
2008
IEEE
16 years 1 months ago
2008
IEEE
— Centrality is a concept often used in social network analysis to study different properties of networks that are modeled as graphs. We present a new centrality metric called Lo...
156
click to vote
FOCS
2005
IEEE
16 years 13 days ago
2005
IEEE
This paper studies the computational complexity of the following type of quadratic programs: given an arbitrary matrix whose diagonal elements are zero, find x ∈ {−1, +1}n th...
161
click to vote
SIGGRAPH
1991
ACM
15 years 10 months ago
1991
ACM
The number of polygons comprising interesting architectural models is many more than can be rendered at interactive frame rates. However, due to occlusion by opaque surfaces (e.g....
189
click to vote
BMCBI
2010
15 years 7 months ago
2010
Background: Phenomenological information about regulatory interactions is frequently available and can be readily converted to Boolean models. Fully quantitative models, on the ot...