Sciweavers

1063 search results - page 38 / 213
» Combining Simple Models to Approximate Complex Dynamics
Sort
View
BMCBI
2008
242views more  BMCBI 2008»
13 years 7 months ago
New time-scale criteria for model simplification of bio-reaction systems
Background: Quasi-steady state approximation (QSSA) based on time-scale analysis is known to be an effective method for simplifying metabolic reaction system, but the conventional...
Junwon Choi, Kyung-won Yang, Tai-yong Lee, Sang Yu...
ICPR
2002
IEEE
14 years 8 months ago
Speeding up SVM Decision Based on Mirror Points
In this paper, we propose a new method to speed up SVM decision based on the idea of mirror points. Decisions based on multiple simple classifiers, which are formed as a result of...
Jiun-Hung Chen, Chu-Song Chen
AAAI
2008
13 years 10 months ago
Planning for Human-Robot Interaction Using Time-State Aggregated POMDPs
In order to interact successfully in social situations, a robot must be able to observe others' actions and base its own behavior on its beliefs about their intentions. Many ...
Frank Broz, Illah R. Nourbakhsh, Reid G. Simmons
JMLR
2010
146views more  JMLR 2010»
13 years 2 months ago
Accurate Ensembles for Data Streams: Combining Restricted Hoeffding Trees using Stacking
The success of simple methods for classification shows that is is often not necessary to model complex attribute interactions to obtain good classification accuracy on practical p...
Albert Bifet, Eibe Frank, Geoffrey Holmes, Bernhar...
STOC
2010
ACM
295views Algorithms» more  STOC 2010»
14 years 15 days ago
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
MohammadHossein Bateni, MohammadTaghi Hajiaghayi a...