Sciweavers

5105 search results - page 83 / 1021
» Approximate Structural Consistency
Sort
View
KCAP
2011
ACM
14 years 2 months ago
Eliciting hierarchical structures from enumerative structures for ontology learning
Some discourse structures such as enumerative structures have typographical, punctuational and laying out characteristics which (1) make them easily identifiable and (2) convey hi...
Mouna Kamel, Bernard Rothenburger
STOC
2006
ACM
170views Algorithms» more  STOC 2006»
16 years 6 days ago
Hardness of approximate two-level logic minimization and PAC learning with membership queries
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...
Vitaly Feldman
UAI
1997
15 years 1 months ago
A Scheme for Approximating Probabilistic Inference
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
Rina Dechter, Irina Rish
BMCBI
2004
127views more  BMCBI 2004»
14 years 11 months ago
MolTalk - a programming library for protein structures and structure analysis
Background: Two of the mostly unsolved but increasingly urgent problems for modern biologists are a) to quickly and easily analyse protein structures and b) to comprehensively min...
Alexander V. Diemand, Holger Scheib
CCCG
2007
15 years 1 months ago
Medial Axis Approximation of Planar Shapes from Union of Balls: A Simpler and more Robust Algorithm
Given a dense sampling S of the smooth boundary of a planar shape O. We show that the medial axis of the union of Voronoi balls centered at Voronoi vertices inside O has a particu...
Joachim Giesen, Balint Miklos, Mark Pauly