Sciweavers

2750 search results - page 162 / 550
» The complexity of learning SUBSEQ(A)
Sort
View
UAI
2008
15 years 8 months ago
Projected Subgradient Methods for Learning Sparse Gaussians
Gaussian Markov random fields (GMRFs) are useful in a broad range of applications. In this paper we tackle the problem of learning a sparse GMRF in a high-dimensional space. Our a...
John Duchi, Stephen Gould, Daphne Koller
EACL
2006
ACL Anthology
15 years 8 months ago
Making Tree Kernels Practical for Natural Language Learning
In recent years tree kernels have been proposed for the automatic learning of natural language applications. Unfortunately, they show (a) an inherent super linear complexity and (...
Alessandro Moschitti
WSC
1998
15 years 8 months ago
Simulation Based Construction Management Learning System
Incorporation into construction engineering and management curricula of tasks that improve the abilities of students to manage the complex dynamics, pressures, and demands of cons...
Anil Sawhney, André Mund
ICASSP
2010
IEEE
15 years 7 months ago
Learning sparse systems at sub-Nyquist rates: A frequency-domain approach
We propose a novel algorithm for sparse system identification in the frequency domain. Key to our result is the observation that the Fourier transform of the sparse impulse respo...
Martin McCormick, Yue M. Lu, Martin Vetterli
BDA
2007
15 years 8 months ago
Hyperplane Queries in a Feature-Space M-tree for Speeding up Active Learning
In content-based retrieval, relevance feedback (RF) is a noticeable method for reducing the “semantic gap” between the low-level features describing the content and the usually...
Michel Crucianu, Daniel Estevez, Vincent Oria, Jea...