Sciweavers

1991 search results - page 8 / 399
» Small Models of Large Machines
Sort
View
FASE
2008
Springer
14 years 11 months ago
Regular Inference for State Machines Using Domains with Equality Tests
Abstract. Existing algorithms for regular inference (aka automata learning) allows to infer a finite state machine by observing the output that the machine produces in response to ...
Therese Berg, Bengt Jonsson, Harald Raffelt
PG
2003
IEEE
15 years 2 months ago
A State Machine for Real-Time Cutting of Tetrahedral Meshes
We introduce an algorithm that consistently and accurately processes arbitrary intersections in tetrahedral meshes in real-time. The intersection surfaces are modeled up to the cu...
Daniel Bielser, Pascal Glardon, Matthias Teschner,...
JISE
2010
144views more  JISE 2010»
14 years 4 months ago
Variant Methods of Reduced Set Selection for Reduced Support Vector Machines
In dealing with large datasets the reduced support vector machine (RSVM) was proposed for the practical objective to overcome the computational difficulties as well as to reduce t...
Li-Jen Chien, Chien-Chung Chang, Yuh-Jye Lee
ICML
1998
IEEE
15 years 1 months ago
The Problem with Noise and Small Disjuncts
Many systems that learn from examples express the learned concept as a disjunction. Those disjuncts that cover only a few examples are referred to as small disjuncts. The problem ...
Gary M. Weiss, Haym Hirsh
AAAI
2000
14 years 11 months ago
A Quantitative Study of Small Disjuncts
Systems that learn from examples often express the learned concept in the form of a disjunctive description. Disjuncts that correctly classify few training examples are known as s...
Gary M. Weiss, Haym Hirsh