Sciweavers

2638 search results - page 29 / 528
» Random Geometric Complexes
Sort
View
APPROX
2008
Springer
119views Algorithms» more  APPROX 2008»
15 years 4 months ago
The Complexity of Distinguishing Markov Random Fields
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...
Andrej Bogdanov, Elchanan Mossel, Salil P. Vadhan
IANDC
2010
87views more  IANDC 2010»
14 years 11 months ago
Effective symbolic dynamics, random points, statistical behavior, complexity and entropy
We consider the dynamical behavior of Martin-L
Stefano Galatolo, Mathieu Hoyrup, Cristobal Rojas
CORR
2007
Springer
113views Education» more  CORR 2007»
15 years 1 months ago
Geometry and the complexity of matrix multiplication
We survey results in algebraic complexity theory, focusing on matrix multiplication. Our goals are (i.) to show how open questions in algebraic complexity theory are naturally pose...
J. M. Landsberg
CC
2010
Springer
282views System Software» more  CC 2010»
15 years 8 days ago
Lower Bounds on the Randomized Communication Complexity of Read-Once Functions
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
Nikos Leonardos, Michael Saks