Sciweavers

183 search results - page 6 / 37
» A Symbolic Out-of-Core Solution Method for Markov Models
Sort
View
RC
2002
72views more  RC 2002»
13 years 7 months ago
Symbolic Preconditioning with Taylor Models: Some Examples
Deterministic global optimization with interval analysis involves - using interval enclosures for ranges of the constraints, objective, and gradient to reject infeasible regions, r...
R. Baker Kearfott, G. William Walster
ICALP
2009
Springer
14 years 7 months ago
The Number of Symbol Comparisons in QuickSort and QuickSelect
Abstract We revisit the classical QuickSort and QuickSelect algorithms, under a complexity model that fully takes into account the elementary comparisons between symbols composing ...
Brigitte Vallée, James Allen Fill, Julien C...
PAKDD
2009
ACM
126views Data Mining» more  PAKDD 2009»
14 years 2 months ago
Tree-Based Method for Classifying Websites Using Extended Hidden Markov Models
One important problem proposed recently in the field of web mining is website classification problem. The complexity together with the necessity to have accurate and fast algorit...
Majid Yazdani, Milad Eftekhar, Hassan Abolhassani
CPE
2003
Springer
149views Hardware» more  CPE 2003»
14 years 25 days ago
Logical and Stochastic Modeling with SMART
We describe the main features of SmArT, a software package providing a seamless environment for the logic and probabilistic analysis of complex systems. SmArT can combine differen...
Gianfranco Ciardo, R. L. Jones III, Andrew S. Mine...
KDD
2004
ACM
127views Data Mining» more  KDD 2004»
14 years 8 months ago
A generative probabilistic approach to visualizing sets of symbolic sequences
There is a notable interest in extending probabilistic generative modeling principles to accommodate for more complex structured data types. In this paper we develop a generative ...
Peter Tiño, Ata Kabán, Yi Sun