Sciweavers

81 search results - page 13 / 17
» Bounding the Partition Function of Spin-Systems
Sort
View
COCO
2006
Springer
118views Algorithms» more  COCO 2006»
13 years 11 months ago
Learning Monotone Decision Trees in Polynomial Time
We give an algorithm that learns any monotone Boolean function f : {-1, 1}n {-1, 1} to any constant accuracy, under the uniform distribution, in time polynomial in n and in the de...
Ryan O'Donnell, Rocco A. Servedio
VIS
2008
IEEE
192views Visualization» more  VIS 2008»
14 years 8 months ago
Smooth Surface Extraction from Unstructured Point-based Volume Data Using PDEs
Abstract--Smooth surface extraction using partial differential equations (PDEs) is a well-known and widely used technique for visualizing volume data. Existing approaches operate o...
Paul Rosenthal, Lars Linsen
EOR
2010
99views more  EOR 2010»
13 years 7 months ago
Min sum clustering with penalties
Traditionally, clustering problems are investigated under the assumption that all objects must be clustered. A shortcoming of this formulation is that a few distant objects, calle...
Refael Hassin, Einat Or
BCB
2010
150views Bioinformatics» more  BCB 2010»
13 years 2 months ago
Enzymatic target identification with dynamic states
As a metabolic network reaches from a state to a steady state, a subset of its fluxes gradually change. The sequence of intermediate states, called the dynamic state, shows the pa...
Bin Song, Sanjay Ranka, Tamer Kahveci
CORR
2012
Springer
170views Education» more  CORR 2012»
12 years 3 months 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