Sciweavers

13603 search results - page 179 / 2721
» On the Computational Complexity of Cut-Reduction
Sort
View
CORR
2007
Springer
94views Education» more  CORR 2007»
15 years 6 months ago
Size reduction of complex networks preserving modularity
The ubiquity of modular structure in real-world complex networks is being the focus of attention in many trials to understand the interplay between network topology and functionali...
Alex Arenas, J. Duch, A. Fernandez, Sergio G&oacut...
JMLR
2006
118views more  JMLR 2006»
15 years 6 months ago
Learning Factor Graphs in Polynomial Time and Sample Complexity
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...
Pieter Abbeel, Daphne Koller, Andrew Y. Ng
TCS
2008
15 years 6 months ago
On the complexity of real root isolation using continued fractions
We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algeb...
Elias P. Tsigaridas, Ioannis Z. Emiris
TSP
2008
86views more  TSP 2008»
15 years 6 months ago
Fixed-Complexity Soft MIMO Detection via Partial Marginalization
Abstract--This paper presents a new approach to soft demodulation for MIMO channels. The proposed method is an approximation to the exact a posteriori probability-per-bit computer....
Erik G. Larsson, Joakim Jalden
ASIACRYPT
2010
Springer
15 years 4 months ago
The Round Complexity of Verifiable Secret Sharing: The Statistical Case
We consider the round complexity of a basic cryptographic task: verifiable secret sharing (VSS). This well-studied primitive provides a good "test case" for our understan...
Ranjit Kumaresan, Arpita Patra, C. Pandu Rangan