2200 search results - page 99 / 440 » Bloch's Constant is Computable |
192
click to vote
IWOCA
2010
Springer
15 years 1 months ago
2010
Springer
We consider here the problem of chaining seeds in ordered trees. Seeds are mappings between two trees Q and T and a chain is a subset of non overlapping seeds that is consistent wi...
156
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
Consider an acyclic directed network G with sources S1, S2, . . . , Sl and distinct sinks R1, R2, . . . , Rl. For i = 1, 2, . . . , l, let ci denote the min-cut between Si and Ri....
201
click to vote
SDM
2012
SIAM
13 years 8 months ago
2012
SIAM
: Feature Selection “Tomography” - Illustrating that Optimal Feature Filtering is Hopelessly Ungeneralizable George Forman HP Laboratories HPL-2010-19R1 Feature selection; ...
159
click to vote
FOCS
2006
IEEE
16 years 13 days ago
2006
IEEE
We give the first representation-independent hardness results for PAC learning intersections of halfspaces, a central concept class in computational learning theory. Our hardness...
131
click to vote
COMPUTING
1998
15 years 6 months ago
1998
We give some estimates related to nite element multilevel splittings and Sobolev norms of negative order. Basically, results for the positive order case are carried over by dualit...