Sciweavers

2694 search results - page 32 / 539
» Fully Distributed Algorithms for Convex Optimization Problem...
Sort
View
SIGECOM
2011
ACM
232views ECommerce» more  SIGECOM 2011»
14 years 14 days ago
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
Nikhil R. Devanur, Kamal Jain, Balasubramanian Siv...
ICRA
2010
IEEE
102views Robotics» more  ICRA 2010»
14 years 8 months ago
A fast n-dimensional ray-shooting algorithm for grasping force optimization
We present an efficient algorithm for solving the ray-shooting problem on high dimensional sets. Our algorithm computes the intersection of the boundary of a compact convex set w...
Yu Zheng, Ming C. Lin, Dinesh Manocha
SODA
2008
ACM
105views Algorithms» more  SODA 2008»
14 years 11 months ago
Distribution-sensitive point location in convex subdivisions
A data structure is presented for point location in convex planar subdivisions when the distribution of queries is known in advance. The data structure has an expected query time t...
Sébastien Collette, Vida Dujmovic, John Iac...
JOTA
2011
149views more  JOTA 2011»
14 years 4 months ago
Globally Convergent Cutting Plane Method for Nonconvex Nonsmooth Minimization
: Nowadays, solving nonsmooth (not necessarily differentiable) optimization problems plays a very important role in many areas of industrial applications. Most of the algorithms d...
Napsu Karmitsa, Mario Tanaka Filho, José He...
81
Voted
SDM
2010
SIAM
168views Data Mining» more  SDM 2010»
14 years 8 months ago
Convex Principal Feature Selection
A popular approach for dimensionality reduction and data analysis is principal component analysis (PCA). A limiting factor with PCA is that it does not inform us on which of the o...
Mahdokht Masaeli, Yan Yan, Ying Cui, Glenn Fung, J...