Sciweavers

3941 search results - page 17 / 789
» Computational Efficiency of Batching Methods
Sort
View
WAE
2000
128views Algorithms» more  WAE 2000»
13 years 10 months ago
Planar Point Location for Large Data Sets: To Seek or Not to Seek
We present an algorithm for external memory planar point location that is both effective and easy to implement. The base algorithm is an external memory variant of the bucket metho...
Jan Vahrenhold, Klaus Hinrichs
ICDCS
1999
IEEE
14 years 1 months ago
Imprecise Calendars: an Approach to Scheduling Computational Grids
We describe imprecise calendars, a way to organize and schedule clusters of nodes in a computation grid. Imprecise calendars permit the easy and efficient sharing of resources bet...
Jeffrey K. Hollingsworth, Songrit Maneewongvatana
CCE
2004
13 years 8 months ago
Computational studies using a novel simplicial-approximation based algorithm for MINLP optimization
Significant advances have been made in the last two decades for the effective solution of mixed integer non-linear programming (MINLP) problems, mainly by exploiting the special s...
Vishal Goyal, Marianthi G. Ierapetritou
CVPR
2007
IEEE
14 years 10 months ago
Incremental Linear Discriminant Analysis Using Sufficient Spanning Set Approximations
This paper presents a new incremental learning solution for Linear Discriminant Analysis (LDA). We apply the concept of the sufficient spanning set approximation in each update st...
Björn Stenger, Josef Kittler, Roberto Cipolla...
WSC
2007
13 years 11 months ago
Indifference-zone subset selection procedures: using sample means to improve efficiency
Two-stage selection procedures have been widely studied and applied in determining the required sample size (i.e., the number of replications or batches) for selecting the best of...
E. Jack Chen