Sciweavers

999 search results - page 61 / 200
» Spectral simplex method
Sort
View
SODA
1998
ACM
114views Algorithms» more  SODA 1998»
14 years 11 months ago
Exact Arithmetic at Low Cost - A Case Study in Linear Programming
We describe a new exact-arithmetic approach to linear programming when the number of variables n is much larger than the number of constraints m (or vice versa). The algorithm is ...
Bernd Gärtner
EOR
2007
111views more  EOR 2007»
14 years 10 months ago
Linear programming based algorithms for preemptive and non-preemptive RCPSP
: In this paper, the RCPSP (Resource Constrained Project Scheduling Problem) is solved using a linear programming model. Each activity may or may not be preemptive. Each variable i...
Jean Damay, Alain Quilliot, Eric Sanlaville
SSIAI
2002
IEEE
15 years 2 months ago
Automatic Referencing of Multi-Spectral Images
In order to adequately process satellite and radar information, it is necessary to find the exact correspondence between different types of images and between these images and th...
Roberto Araiza, Hongjie Xie, Scott A. Starks, Vlad...
VISUALIZATION
2002
IEEE
15 years 2 months ago
Interactive Spectral Volume Rendering
We describe a method for volume rendering using a spectral representation of colour instead of the traditional RGB model. It is shown how to use this framework for a novel explora...
Steven Bergner, Torsten Möller, Mark S. Drew,...
CORR
2010
Springer
107views Education» more  CORR 2010»
14 years 7 months ago
Metric uniformization and spectral bounds for graphs
We present a method for proving upper bounds on the eigenvalues of the graph Laplacian. A main step involves choosing an appropriate "Riemannian" metric to uniformize th...
Jonathan A. Kelner, James R. Lee, Gregory N. Price...