Sciweavers

385 search results - page 64 / 77
» On higher-order perceptron algorithms
Sort
View
TOG
2002
165views more  TOG 2002»
13 years 9 months ago
CHARMS: a simple framework for adaptive simulation
Finite element solvers are a basic component of simulation applications; they are common in computer graphics, engineering, and medical simulations. Although adaptive solvers can ...
Eitan Grinspun, Petr Krysl, Peter Schröder
JGO
2010
100views more  JGO 2010»
13 years 4 months ago
On convex relaxations of quadrilinear terms
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
Sonia Cafieri, Jon Lee, Leo Liberti
ICDM
2006
IEEE
119views Data Mining» more  ICDM 2006»
14 years 3 months ago
Fast On-line Kernel Learning for Trees
Kernel methods have been shown to be very effective for applications requiring the modeling of structured objects. However kernels for structures usually are too computational dem...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...
WWW
2008
ACM
14 years 10 months ago
Online learning from click data for sponsored search
Sponsored search is one of the enabling technologies for today's Web search engines. It corresponds to matching and showing ads related to the user query on the search engine...
Massimiliano Ciaramita, Vanessa Murdock, Vassilis ...
ICIP
2004
IEEE
14 years 11 months ago
Estimating the quality of face localization for face verification
Face localization is the process of finding the exact position of a face in a given image. This can be useful in several applications such as face tracking or person authenticatio...
Yann Rodriguez, Fabien Cardinaux, Samy Bengio, Joh...