Sciweavers

713 search results - page 137 / 143
» A new iterative method for solving nonlinear equations
Sort
View
ESA
2003
Springer
111views Algorithms» more  ESA 2003»
14 years 20 days ago
Fast Smallest-Enclosing-Ball Computation in High Dimensions
Abstract. We develop a simple combinatorial algorithm for computing the smallest enclosing ball of a set of points in high dimensional Euclidean space. The resulting code is in mos...
Kaspar Fischer, Bernd Gärtner, Martin Kutz
KBSE
2002
IEEE
14 years 11 days ago
Generating Test Data for Functions with Pointer Inputs
Generating test inputs for a path in a function with integer and real parameters is an important but difficult problem. The problem becomes more difficult when pointers are pass...
Srinivas Visvanathan, Neelam Gupta
SIGMETRICS
2000
ACM
105views Hardware» more  SIGMETRICS 2000»
13 years 11 months ago
Using the exact state space of a Markov model to compute approximate stationary measures
We present a new approximation algorithm based on an exact representation of the state space S, using decision diagrams, and of the transition rate matrix R, using Kronecker algeb...
Andrew S. Miner, Gianfranco Ciardo, Susanna Donate...
SDM
2008
SIAM
144views Data Mining» more  SDM 2008»
13 years 9 months ago
Active Learning with Model Selection in Linear Regression
Optimally designing the location of training input points (active learning) and choosing the best model (model selection) are two important components of supervised learning and h...
Masashi Sugiyama, Neil Rubens
NECO
2008
108views more  NECO 2008»
13 years 7 months ago
An SMO Algorithm for the Potential Support Vector Machine
We describe a fast Sequential Minimal Optimization (SMO) procedure for solving the dual optimization problem of the recently proposed Potential Support Vector Machine (P-SVM). The...
Tilman Knebel, Sepp Hochreiter, Klaus Obermayer