Sciweavers

1120 search results - page 143 / 224
» Eager Markov Chains
Sort
View
JCP
2006
111views more  JCP 2006»
14 years 12 months ago
Mining Developing Trends of Dynamic Spatiotemporal Data Streams
This paper1 presents an efficient modeling technique for data streams in a dynamic spatiotemporal environment and its suitability for mining developing trends. The streaming data a...
Yu Meng, Margaret H. Dunham
DKE
2007
95views more  DKE 2007»
14 years 12 months ago
Strategies for improving the modeling and interpretability of Bayesian networks
One of the main factors for the knowledge discovery success is related to the comprehensibility of the patterns discovered by applying data mining techniques. Amongst which we can...
Ádamo L. de Santana, Carlos Renato Lisboa F...
ENTCS
2007
69views more  ENTCS 2007»
14 years 11 months ago
Modal Logic Characterization of Markovian Testing and Trace Equivalences
Markovian testing and trace equivalences have been recently proposed as reasonable alternatives to Markovian bisimilarity, as both of them induce at the Markov chain level an aggr...
Marco Bernardo, Stefania Botta
NAR
2008
73views more  NAR 2008»
14 years 11 months ago
LocalMove: computing on-lattice fits for biopolymers
Given an input Protein Data Bank file (PDB) for a protein or RNA molecule, LocalMove is a web server that determines an on-lattice representation for the input biomolecule. The we...
Yann Ponty, R. Istrate, E. Porcelli, Peter Clote
TCS
2008
14 years 11 months ago
The cost of offline binary search tree algorithms and the complexity of the request sequence
In evaluating the performance of online algorithms for search trees, one wants to compare them to the best offline algorithm available. In this paper we lower bound the cost of an...
Jussi Kujala, Tapio Elomaa