Sciweavers

2031 search results - page 140 / 407
» Approximation Algorithms for 2-Stage Stochastic Optimization...
Sort
View
JGO
2010
117views more  JGO 2010»
13 years 6 months ago
Machine learning problems from optimization perspective
Both optimization and learning play important roles in a system for intelligent tasks. On one hand, we introduce three types of optimization tasks studied in the machine learning l...
Lei Xu
SIAMSC
2010
155views more  SIAMSC 2010»
13 years 3 months ago
Quasi-Newton Methods on Grassmannians and Multilinear Approximations of Tensors
In this paper we proposed quasi-Newton and limited memory quasi-Newton methods for objective functions defined on Grassmannians or a product of Grassmannians. Specifically we defin...
Berkant Savas, Lek-Heng Lim
SIGECOM
2008
ACM
94views ECommerce» more  SIGECOM 2008»
13 years 8 months ago
Optimizing query rewrites for keyword-based advertising
We consider the problem of query rewrites in the context of keyword advertisement. Given a three-layer graph consisting of queries, query rewrites, and the corresponding ads that ...
Azarakhsh Malekian, Chi-Chao Chang, Ravi Kumar, Gr...
ISAAC
2009
Springer
168views Algorithms» more  ISAAC 2009»
14 years 2 months ago
On the Camera Placement Problem
We introduce a new probing problem: what is the minimum number of cameras at fixed positions necessary and sufficient to reconstruct any strictly convex polygon contained in a dis...
Rudolf Fleischer, Yihui Wang
SODA
1998
ACM
128views Algorithms» more  SODA 1998»
13 years 9 months ago
A Polynomial-Time Approximation Scheme for Weighted Planar Graph TSP
Given a planar graph on n nodes with costs weights on its edges, de ne the distance between nodes i and j as the length of the shortest path between i and j. Consider this as an i...
Sanjeev Arora, Michelangelo Grigni, David R. Karge...