Sciweavers

2056 search results - page 132 / 412
» time 2000
Sort
View
IWFM
2000
162views Formal Methods» more  IWFM 2000»
15 years 6 months ago
Modal Logics for Reasoning about Object-based Component Composition
Component-oriented development of software supports the adaptability and maintainability of large systems, in particular if requirements change over time and parts of a system hav...
Claus Pahl
147
Voted
NIPS
2000
15 years 6 months ago
Incremental and Decremental Support Vector Machine Learning
An on-line recursive algorithm for training support vector machines, one vector at a time, is presented. Adiabatic increments retain the KuhnTucker conditions on all previously se...
Gert Cauwenberghs, Tomaso Poggio
NIPS
2000
15 years 6 months ago
Occam's Razor
The Bayesian paradigm apparently only sometimes gives rise to Occam's Razor; at other times very large models perform well. We give simple examples of both kinds of behaviour...
Carl Edward Rasmussen, Zoubin Ghahramani
143
Voted
PDPTA
2000
15 years 6 months ago
Dependable High Performance Computing on a Parallel Sysplex Cluster
In this paper we address the issue of dependable distributed high performance computing in the field of Symbolic Computation. We describe the extension of a middleware infrastructu...
Wolfgang Blochinger, Reinhard Bündgen, Andrea...
SODA
2000
ACM
120views Algorithms» more  SODA 2000»
15 years 6 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