845 search results - page 37 / 169 » Complexity Dimensions and Learnability |
137
click to vote
DCG
2010
15 years 3 months ago
2010
We present a Delaunay refinement algorithm for meshing a piecewise smooth complex in three dimensions. The algorithm protects edges with weighted points to avoid the difficulty po...
103
click to vote
JC
2006
15 years 3 months ago
2006
We study the information complexity in the randomized setting of solving a general elliptic PDE of order 2m in a smooth, bounded domain Q Rd with smooth coefficients and homogene...
119
click to vote
FOCS
2008
IEEE
15 years 9 months ago
2008
IEEE
We study the problem of finding the minimum size DNF formula for a function f : {0, 1}d → {0, 1} given its truth table. We show that unless NP ⊆ DTIME(npoly(log n) ), there i...
COLT
2003
Springer
15 years 8 months ago
2003
Springer
A mere bounded number of random bits judiciously employed by a probabilistically correct algorithmic coordinator is shown to increase the power of learning to coordinate compared ...
117
click to vote
ATAL
2008
Springer
15 years 5 months ago
2008
Springer
Scoring rules are a broad and concisely-representable class of voting rules which includes, for example, Plurality and Borda. Our main result asserts that the class of scoring rul...