Sciweavers

406 search results - page 15 / 82
» Gadgets, Approximation, and Linear Programming
Sort
View
STOC
2009
ACM
136views Algorithms» more  STOC 2009»
14 years 10 months ago
Random walks on polytopes and an affine interior point method for linear programming
Let K be a polytope in Rn defined by m linear inequalities. We give a new Markov Chain algorithm to draw a nearly uniform sample from K. The underlying Markov Chain is the first t...
Ravi Kannan, Hariharan Narayanan
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
14 years 10 months ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales
IPPS
2006
IEEE
14 years 3 months ago
Memory minimization for tensor contractions using integer linear programming
This paper presents a technique for memory optimization for a class of computations that arises in the field of correlated electronic structure methods such as coupled cluster and...
A. Allam, J. Ramanujam, Gerald Baumgartner, P. Sad...
CORR
2011
Springer
215views Education» more  CORR 2011»
13 years 1 months ago
Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...
Venkatesan Guruswami, Ali Kemal Sinop
COCOA
2008
Springer
13 years 11 months ago
Efficient Method for Periodic Task Scheduling with Storage Requirement Minimization
Abstract. In this paper, we study an efficient approximate integer linear programming formulation of the general problem of one-dimensional periodic task scheduling under storage r...
Karine Deschinkel, Sid Ahmed Ali Touati