Sciweavers

1356 search results - page 69 / 272
» Some New Results on Inverse Sorting Problems
Sort
View
JMLR
2010
143views more  JMLR 2010»
13 years 7 months ago
A Quasi-Newton Approach to Nonsmooth Convex Optimization Problems in Machine Learning
We extend the well-known BFGS quasi-Newton method and its memory-limited variant LBFGS to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by ge...
Jin Yu, S. V. N. Vishwanathan, Simon Günter, ...
ENTCS
2006
139views more  ENTCS 2006»
13 years 9 months ago
Improving the Usability of a Graph Transformation Language
Model transformation tools implemented using graph transformation techniques are often expected to provide high performance. For this reason, in the Graph Rewriting and Transforma...
Attila Vizhanyo, Sandeep Neema, Feng Shi, Daniel B...
COLT
1999
Springer
14 years 1 months ago
Regret Bounds for Prediction Problems
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
Geoffrey J. Gordon
ICCV
1999
IEEE
14 years 11 months ago
Capturing Articulated Human Hand Motion: A Divide-and-Conquer Approach
The use of human hand as a natural interface device serves as a motivating force for research in the modeling, analyzing and capturing of the motion of articulated hand. Model-bas...
Ying Wu, Thomas S. Huang
ICCAD
2002
IEEE
126views Hardware» more  ICCAD 2002»
14 years 2 months ago
Robust and passive model order reduction for circuits containing susceptance elements
Numerous approaches have been proposed to address the overwhelming modeling problems that result from the emergence of magnetic coupling as a dominant performance factor for ICs a...
Hui Zheng, Lawrence T. Pileggi