19320 search results - page 3525 / 3864 » On the complexity of computing determinants |
211
click to vote
GRAMMARS
1998
15 years 6 months ago
1998
From the perspective of the linguist, the theory of formal languages serves as an abstract model to address issues such as complexity, learnability, information content, etc. which...
192
click to vote
CGF
1999
15 years 6 months ago
1999
Light fields and Lumigraphs are capable of rendering scenes of arbitrary geometrical or illumination complexity in real time. They are thus interesting ways of interacting with bo...
166
click to vote
JACM
1998
15 years 6 months ago
1998
Given a collection Ᏺ of subsets of S ϭ {1, . . . , n}, set cover is the problem of selecting as few as possible subsets from Ᏺ such that their union covers S, and max k-cover ...
199
click to vote
JMLR
2002
15 years 6 months ago
2002
We present some greedy learning algorithms for building sparse nonlinear regression and classification models from observational data using Mercer kernels. Our objective is to dev...
200
click to vote
DAM
1999
15 years 6 months ago
1999
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...