Sciweavers

2317 search results - page 306 / 464
» classification 2008
Sort
View
TCS
2008
15 years 26 days ago
Cleaning a network with brushes
Following the decontamination metaphor for searching a graph, we introduce a cleaning process, which is related to both the chip-firing game and edge searching. Brushes (instead o...
Margaret-Ellen Messinger, Richard J. Nowakowski, P...
CSDA
2004
124views more  CSDA 2004»
15 years 24 days ago
Fast and robust discriminant analysis
The goal of discriminant analysis is to obtain rules that describe the separation between groups of observations. Moreover it allows to classify new observations into one of the k...
Mia Hubert, Katrien van Driessen
SIAMCO
2000
75views more  SIAMCO 2000»
15 years 22 days ago
Generic Simplicity of the Spectrum and Stabilization for a Plate Equation
In this work we prove the generic simplicity of the spectrum of the clamped plate equation in a bounded regular domain of Rd. That is, given Rd, we show that there exists an arbi...
Jaime H. Ortega, Enrique Zuazua
104
Voted
SIAMCOMP
2000
109views more  SIAMCOMP 2000»
15 years 22 days ago
Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph
Abstract. We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and parti...
Endre Boros, Vladimir Gurvich, Leonid Khachiyan, K...
SIAMDM
2000
103views more  SIAMDM 2000»
15 years 22 days ago
Directional Routing via Generalized st-Numberings
We present a mathematical model for network routing based on generating paths in a consistent direction. Our development is based on an algebraic and geometric framework for defini...
Fred S. Annexstein, Kenneth A. Berman