Sciweavers

3192 search results - page 91 / 639
» The minimum latency problem
Sort
View
89
Voted
FOCS
1992
IEEE
15 years 2 months ago
Dynamic Half-Space Reporting, Geometric Optimization, and Minimum Spanning Trees
We describe dynamic data structures for half-space range reporting and for maintaining the minima of a decomposable function. Using these data structures, we obtain efficient dyna...
Pankaj K. Agarwal, David Eppstein, Jirí Mat...
97
Voted
SODA
2000
ACM
120views Algorithms» more  SODA 2000»
14 years 11 months ago
Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks
This paper shows that the minimum ratio canceling algorithm of Wallacher (1989) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with ...
S. Thomas McCormick, Akiyoshi Shioura
78
Voted
PR
2006
93views more  PR 2006»
14 years 10 months ago
Learning the kernel parameters in kernel minimum distance classifier
Choosing appropriate values for kernel parameters is one of the key problems in many kernel-based methods because the values of these parameters have significant impact on the per...
Daoqiang Zhang, Songcan Chen, Zhi-Hua Zhou
AUTOMATICA
2002
62views more  AUTOMATICA 2002»
14 years 10 months ago
On minimal-order stabilization of minimum phase plants
In this note, the problem of minimal-order stabilization in the case where the plant is minimum phase is studied. A low bound on the order of stabilizers is derived and a set of m...
Weidong Zhang, Xiaoming Xu
ICPR
2006
IEEE
15 years 11 months ago
A Minimum Sphere Covering Approach to Pattern Classification
In this paper we present a minimum sphere covering approach to pattern classification that seeks to construct a minimum number of spheres to represent the training data and formul...
Jigang Wang, Predrag Neskovic, Leon N. Cooper