Sciweavers

6142 search results - page 224 / 1229
» The Complexity of Partition Functions
Sort
View
JUCS
2000
120views more  JUCS 2000»
15 years 4 months ago
Execution and Cache Performance of the Scheduled Dataflow Architecture
: This paper presents an evaluation of our Scheduled Dataflow (SDF) Processor. Recent focus in the field of new processor architectures is mainly on VLIW (e.g. IA-64), superscalar ...
Krishna M. Kavi, Joseph Arul, Roberto Giorgi
CORR
2012
Springer
170views Education» more  CORR 2012»
14 years 19 days ago
What Cannot be Learned with Bethe Approximations
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
Uri Heinemann, Amir Globerson
INFOCOM
2012
IEEE
13 years 7 months ago
CONSEL: Connectivity-based segmentation in large-scale 2D/3D sensor networks
—A cardinal prerequisite for the system design of a sensor network, is to understand the geometric environment where sensor nodes are deployed. The global topology of a largescal...
Hongbo Jiang, Tianlong Yu, Chen Tian, Guang Tan, C...
137
Voted
JBCB
2008
71views more  JBCB 2008»
15 years 4 months ago
Using Indirect protein-protein Interactions for protein Complex Prediction
Protein complexes are fundamental for understanding principles of cellular organizations. Accurate and fast protein complex prediction from the PPI networks of increasing sizes ca...
Hon Nian Chua, Kang Ning, Wing-Kin Sung, Hon Wai L...
SIGSOFT
2007
ACM
16 years 5 months ago
Measuring empirical computational complexity
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilk...