Sciweavers

11565 search results - page 195 / 2313
» Computing Minimal Mappings
Sort
View
SIAMJO
2008
212views more  SIAMJO 2008»
15 years 4 months ago
Convergence Rate of an Optimization Algorithm for Minimizing Quadratic Functions with Separable Convex Constraints
A new active set algorithm for minimizing quadratic functions with separable convex constraints is proposed by combining the conjugate gradient method with the projected gradient. ...
Radek Kucera
EOR
2010
104views more  EOR 2010»
15 years 2 months ago
New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs
We consider the bicriteria scheduling problem of minimizing the number of tardy jobs and average flowtime on a single machine. This problem, which is known to be NP-hard, is impor...
Fatih Safa Erenay, Ihsan Sabuncuoglu, Aysegül...
TSP
2010
14 years 11 months ago
Independent component analysis by entropy bound minimization
A novel (differential) entropy estimator is introduced where the maximum entropy bound is used to approximate the entropy given the observations, and is computed using a numerical ...
Xi-Lin Li, Tülay Adali
CHI
2009
ACM
16 years 5 months ago
Path selection: a novel interaction technique for mapping applications
Michael Ludwig, Reid Priedhorsky, Loren G. Terveen
CHI
2007
ACM
16 years 5 months ago
Mapping semantic relevancy of information displays
Vladislav Daniel Veksler, Wayne D. Gray