Sciweavers

1996 search results - page 359 / 400
» A decision procedure for linear
Sort
View
VISUALIZATION
1997
IEEE
15 years 10 months ago
Simplifying polygonal models using successive mappings
: We present the use of mapping functions to automatically generate levels of detail with known error bounds for polygonal models. We develop a piece-wise linear mapping function f...
Jonathan D. Cohen, Dinesh Manocha, Marc Olano
KDD
2000
ACM
133views Data Mining» more  KDD 2000»
15 years 9 months ago
Data selection for support vector machine classifiers
The problem of extracting a minimal number of data points from a large dataset, in order to generate a support vector machine (SVM) classifier, is formulated as a concave minimiza...
Glenn Fung, Olvi L. Mangasarian
NIPS
1998
15 years 7 months ago
Learning Nonlinear Dynamical Systems Using an EM Algorithm
The Expectation Maximization EM algorithm is an iterative procedure for maximum likelihood parameter estimation from data sets with missing or hidden variables 2 . It has been app...
Zoubin Ghahramani, Sam T. Roweis
IANDC
2008
105views more  IANDC 2008»
15 years 6 months ago
Symbolic protocol analysis for monoidal equational theories
We are interested in the design of automated procedures for analyzing the (in)security of cryptographic protocols in the Dolev-Yao model for a bounded number of sessions when we t...
Stéphanie Delaune, Pascal Lafourcade, Denis...
INFORMS
1998
100views more  INFORMS 1998»
15 years 5 months ago
Feature Selection via Mathematical Programming
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...
Paul S. Bradley, Olvi L. Mangasarian, W. Nick Stre...