Sciweavers

798 search results - page 73 / 160
» Interval Methods: An Introduction
Sort
View
113
Voted
PKDD
2007
Springer
121views Data Mining» more  PKDD 2007»
15 years 8 months ago
Improved Algorithms for Univariate Discretization of Continuous Features
In discretization of a continuous variable its numerical value range is divided into a few intervals that are used in classification. For example, Na¨ıve Bayes can benefit from...
Jussi Kujala, Tapio Elomaa
115
Voted
WSC
2008
15 years 4 months ago
Smooth flexible models of nonhomogeneous poisson processes using one or more process realizations
We develop and evaluate a semiparametric method to estimate the mean-value function of a nonhomogeneous Poisson process (NHPP) using one or more process realizations observed over...
Michael E. Kuhl, Shalaka C. Deo, James R. Wilson
SIAMNUM
2010
106views more  SIAMNUM 2010»
14 years 9 months ago
Computing Sacker-Sell spectra in Discrete Time Dynamical Systems
In this paper we develop boundary value methods for detecting Sacker-Sell spectra in discrete time dynamical systems. The algorithms are advancements of earlier methods for comput...
Thorsten Hüls
131
Voted
GRC
2005
IEEE
15 years 8 months ago
Information granulation and granular relationships
— As an emerging research method to deal with information and knowledge processing, various topics of granular computing have recently received more attention by researchers. The...
Jingtao Yao
ICTAI
2005
IEEE
15 years 8 months ago
Reachability Analysis for Uncertain SSPs
Stochastic Shortest Path problems (SSPs) can be efficiently dealt with by the Real-Time Dynamic Programming algorithm (RTDP). Yet, RTDP requires that a goal state is always reach...
Olivier Buffet