Sciweavers

7167 search results - page 1077 / 1434
» Answer Set Programming
Sort
View
ICCV
2003
IEEE
16 years 5 months ago
Landmark-based Shape Deformation with Topology-Preserving Constraints
This paper presents a novel approach for landmarkbased shape deformation, in which fitting error and shape difference are formulated into a support vector machine (SVM) regression...
Song Wang, Jim Xiuquan Ji, Zhi-Pei Liang
VIS
2009
IEEE
150views Visualization» more  VIS 2009»
16 years 4 months ago
VisMashup: Streamlining the Creation of Custom Visualization Applications
Visualization is essential for understanding the increasing volumes of digital data. However, the process required to create insightful visualizations is involved and time consumin...
Emanuele Santos, Lauro Lins, James P. Ahrens, J...
ICML
2009
IEEE
16 years 4 months ago
SimpleNPKL: simple non-parametric kernel learning
Previous studies of Non-Parametric Kernel (NPK) learning usually reduce to solving some Semi-Definite Programming (SDP) problem by a standard SDP solver. However, time complexity ...
Jinfeng Zhuang, Ivor W. Tsang, Steven C. H. Hoi
ICML
2008
IEEE
16 years 4 months ago
No-regret learning in convex games
Quite a bit is known about minimizing different kinds of regret in experts problems, and how these regret types relate to types of equilibria in the multiagent setting of repeated...
Geoffrey J. Gordon, Amy R. Greenwald, Casey Marks
ICML
2008
IEEE
16 years 4 months ago
Random classification noise defeats all convex potential boosters
A broad class of boosting algorithms can be interpreted as performing coordinate-wise gradient descent to minimize some potential function of the margins of a data set. This class...
Philip M. Long, Rocco A. Servedio
« Prev « First page 1077 / 1434 Last » Next »