Sciweavers

1508 search results - page 220 / 302
» Efficient Path Profiling
Sort
View
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 6 months ago
The Highest Expected Reward Decoding for HMMs with Application to Recombination Detection
Abstract. Hidden Markov models are traditionally decoded by the Viterbi algorithm which finds the highest probability state path in the model. In recent years, several limitations ...
Michal Nánási, Tomás Vinar, B...
JCIT
2010
115views more  JCIT 2010»
13 years 3 months ago
The Recognition Method of Unknown Chinese Words in Fragments Based on Mutual Information
This paper presents a method of using mutual information to improve the recognition algorithm of unknown Chinese words, it can resolve the complexity of weight settings and the in...
Qian Zhu, Xian-Yi Cheng, Zi-juan Gao
JMLR
2010
102views more  JMLR 2010»
13 years 3 months ago
Discover Local Causal Network around a Target to a Given Depth
For a given target node T and a given depth k 1, we propose an algorithm for discovering a local causal network around the target T to depth k. In our algorithm, we find parents,...
You Zhou, Changzhang Wang, Jianxin Yin, Zhi Geng
ICDE
2006
IEEE
144views Database» more  ICDE 2006»
14 years 10 months ago
Approximately Processing Multi-granularity Aggregate Queries over Data Streams
Aggregate monitoring over data streams is attracting more and more attention in research community due to its broad potential applications. Existing methods suffer two problems, 1...
Shouke Qin, Weining Qian, Aoying Zhou
BTW
2005
Springer
113views Database» more  BTW 2005»
14 years 2 months ago
A Learning Optimizer for a Federated Database Management System
: Optimizers in modern DBMSs utilize a cost model to choose an efficient query execution plan (QEP) among all possible ones for a given query. The accuracy of the cost estimates de...
Stephan Ewen, Michael Ortega-Binderberger, Volker ...