Sciweavers

3251 search results - page 284 / 651
» On a vector q-d algorithm
Sort
View
SIAMJO
2008
81views more  SIAMJO 2008»
15 years 5 months ago
A First-Order Convergence Analysis of Trust-Region Methods with Inexact Jacobians
A class of trust-region algorithms is developed and analyzed for the solution of minimization problems with nonlinear inequality constraints. Based on composite-step trust region ...
Andrea Walther
FOCS
2010
IEEE
15 years 5 months ago
Learning Convex Concepts from Gaussian Distributions with PCA
We present a new algorithm for learning a convex set in n-dimensional space given labeled examples drawn from any Gaussian distribution. The complexity of the algorithm is bounded ...
Santosh Vempala
STOC
2007
ACM
83views Algorithms» more  STOC 2007»
16 years 7 months ago
Lattices that admit logarithmic worst-case to average-case connection factors
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
Chris Peikert, Alon Rosen
NLDB
2007
Springer
16 years 1 months ago
Four Methods for Supervised Word Sense Disambiguation
Word sense disambiguation is the task to identify the intended meaning of an ambiguous word in a certain context, one of the central problems in natural language processing. This p...
Kinga Schumacher
CCCG
2010
15 years 8 months ago
Sweeping minimum perimeter enclosing parallelograms: Optimal crumb cleanup
We examine the problem of pushing all the points of a planar region into one point using parallel sweeps of an infinite line, minimizing the sum of the lengths of the sweep vector...
Yonit Bousany, Mary Leah Karker, Joseph O'Rourke, ...