Sciweavers

6142 search results - page 29 / 1229
» The Complexity of Partition Functions
Sort
View
DAC
1994
ACM
15 years 1 months ago
Partitioning Very Large Circuits Using Analytical Placement Techniques
A new partitioningapproach for very largecircuits is described. We demonstrate that applying a recently developed analytical placement algorithm, that pro ts from a linear objecti...
Bernhard M. Riess, Konrad Doll, Frank M. Johannes
ICML
2008
IEEE
15 years 10 months ago
On the quantitative analysis of deep belief networks
Deep Belief Networks (DBN's) are generative models that contain many layers of hidden variables. Efficient greedy algorithms for learning and approximate inference have allow...
Ruslan Salakhutdinov, Iain Murray
COMPLEXITY
2010
119views more  COMPLEXITY 2010»
14 years 7 months ago
Language networks: Their structure, function, and evolution
Ricard V. Solé, Bernat Corominas-Murtra, Se...
SODA
2003
ACM
127views Algorithms» more  SODA 2003»
14 years 11 months ago
Binary space partitions for 3D subdivisions
We consider the following question: Given a subdivision of space into n convex polyhedral cells, what is the worst-case complexity of a binary space partition (BSP) for the subdiv...
John Hershberger, Subhash Suri
COLOGNETWENTE
2010
14 years 8 months ago
Complexity of O'Hara's Algorithm
In this paper we analyze O’Hara’s partition bijection. We present three type of results. First, we show that O’Hara’s bijection can be viewed geometrically as a certain sci...
Matjaz Konvalinka, Igor Pak