895 search results - page 74 / 179 » Using graphs for some discrete tomography problems |
ASIACRYPT
2001
Springer
14 years 2 months ago
2001
Springer
A Zero-knowledge protocol provides provably secure entity authentication based on a hard computational problem. Among many schemes proposed since 1984, the most practical rely on f...
ACMSE
2006
ACM
14 years 5 months ago
2006
ACM
We propose an efficient and novel approach for discovering communities in real-world random networks. Communities are formed by subsets of nodes in a graph, which are closely rela...
ICALP
2007
Springer
14 years 5 months ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
ICCAD
2006
IEEE
14 years 8 months ago
2006
IEEE
We present the first efficient approach to global routing that takes spacing-dependent costs into account and provably finds a near-optimum solution including these costs. We sh...
SPAA
2005
ACM
14 years 4 months ago
2005
ACM
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...