Sciweavers

238 search results - page 14 / 48
» Waiting time distribution of generalized later patterns
Sort
View
ALMOB
2006
80views more  ALMOB 2006»
13 years 9 months ago
Effective p-value computations using Finite Markov Chain Imbedding (FMCI): application to local score and to pattern statistics
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...
Grégory Nuel
KDD
2009
ACM
132views Data Mining» more  KDD 2009»
14 years 9 months ago
Learning patterns in the dynamics of biological networks
Our dynamic graph-based relational mining approach has been developed to learn structural patterns in biological networks as they change over time. The analysis of dynamic network...
Chang Hun You, Lawrence B. Holder, Diane J. Cook
ATAL
2010
Springer
13 years 10 months ago
Decision making with dynamically arriving information
Decision making is the ability to decide on the best alternative among a set of candidates based on their value. In many real-world domains the value depends on events that occur ...
Meir Kalech, Avi Pfeffer
SEMWEB
2007
Springer
14 years 3 months ago
Vocabulary Patterns in Free-for-all Collaborative Indexing Systems
In collaborative indexing systems users generate a big amount of metadata by labelling web-based content. These labels are known as tags and form a shared vocabulary. In order to u...
Wolfgang Maass, Tobias Kowatsch, Timo Münster
QUESTA
2006
98views more  QUESTA 2006»
13 years 9 months ago
The discrete-time preemptive repeat identical priority queue
Priority queueing systems come natural when customers with diversified delay requirements have to wait to get service. The customers that cannot tolerate but small delays get serv...
Joris Walraevens, Dieter Fiems, Herwig Bruneel