Sciweavers

3607 search results - page 52 / 722
» Learning with structured sparsity
Sort
View
ACL
2010
13 years 6 months ago
Predicate Argument Structure Analysis Using Transformation Based Learning
Maintaining high annotation consistency in large corpora is crucial for statistical learning; however, such work is hard, especially for tasks containing semantic elements. This p...
Hirotoshi Taira, Sanae Fujita, Masaaki Nagata
NIPS
2007
13 years 9 months ago
The Generalized FITC Approximation
We present an efficient generalization of the sparse pseudo-input Gaussian process (SPGP) model developed by Snelson and Ghahramani [1], applying it to binary classification pro...
Andrew Naish-Guzman, Sean B. Holden
FLAIRS
2004
13 years 9 months ago
ABSURDIST II: A Graph Matching Algorithm and its Application to Conceptual System Translation
ABSURDIST II, an extension to ABSURDIST, is an algorithm using attributed graph matching to find translations between conceptual systems. It uses information about the internal st...
Ying Feng, Robert L. Goldstone, Vladimir Menkov
CORR
2010
Springer
59views Education» more  CORR 2010»
13 years 6 months ago
Noise Invalidation Denoising
—A denoising technique based on noise invalidation is proposed. The adaptive approach derives a noise signature from the noise order statistics and utilizes the signature to deno...
Soosan Beheshti, Masoud Hashemi, Xiao-Ping Zhang, ...
PAMI
2010
145views more  PAMI 2010»
13 years 2 months ago
Texture Synthesis with Grouplets
This paper proposes a new method to synthesize and inpaint geometric textures. The texture model is composed of a geometric layer that drives the computation of a new grouplet tran...
Gabriel Peyré