Sciweavers

364 search results - page 17 / 73
» Dimension Characterizations of Complexity Classes
Sort
View
COMPGEOM
2008
ACM
13 years 9 months ago
Delpsc: a delaunay mesher for piecewise smooth complexes
This video presents the working of a new algorithm/software called DelPSC that meshes piecewise smooth complexes in three dimensions with Delaunay simplices. Piecewise smooth comp...
Tamal K. Dey, Joshua A. Levine
ICALP
2005
Springer
14 years 26 days ago
Hadamard Tensors and Lower Bounds on Multiparty Communication Complexity
We develop a new method for estimating the discrepancy of tensors associated with multiparty communication problems in the “Number on the Forehead” model of Chandra, Furst and...
Jeff Ford, Anna Gál
BMCBI
2011
12 years 11 months ago
HomPPI: A Class of Sequence Homology Based Protein-Protein Interface Prediction Methods
Background: Although homology-based methods are among the most widely used methods for predicting the structure and function of proteins, the question as to whether interface sequ...
Li C. Xue, Drena Dobbs, Vasant Honavar
STOC
1994
ACM
128views Algorithms» more  STOC 1994»
13 years 11 months ago
Weakly learning DNF and characterizing statistical query learning using Fourier analysis
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...
Avrim Blum, Merrick L. Furst, Jeffrey C. Jackson, ...
ALT
2005
Springer
14 years 4 months ago
Teaching Learners with Restricted Mind Changes
Within learning theory teaching has been studied in various ways. In a common variant the teacher has to teach all learners that are restricted to output only consistent hypotheses...
Frank J. Balbach, Thomas Zeugmann