Sciweavers

1536 search results - page 50 / 308
» Approximately Dominating Representatives
Sort
View
EMNLP
2010
13 years 8 months ago
Turbo Parsers: Dependency Parsing by Approximate Variational Inference
We present a unified view of two state-of-theart non-projective dependency parsers, both approximate: the loopy belief propagation parser of Smith and Eisner (2008) and the relaxe...
André F. T. Martins, Noah A. Smith, Eric P....
ALGORITHMICA
2011
13 years 5 months ago
An Approximation Algorithm for Binary Searching in Trees
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find...
Eduardo Sany Laber, Marco Molinaro
ICPR
2000
IEEE
14 years 11 months ago
On Gaussian Radial Basis Function Approximations: Interpretation, Extensions, and Learning Strategies
In this paper we focus on an interpretation of Gaussian radial basis functions (GRBF) which motivates extensions and learning strategies. Specifically, we show that GRBF regressio...
Mário A. T. Figueiredo
SIGGRAPH
1997
ACM
14 years 1 months ago
Non-linear approximation of reflectance functions
We introduce a new class of primitive functions with non-linear parameters for representing light reflectance functions. The functions are reciprocal, energy-conserving and expres...
Eric P. Lafortune, Sing-Choong Foo, Kenneth E. Tor...
NIPS
2007
13 years 11 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