Sciweavers

1015 search results - page 198 / 203
» An efficient algorithm for AS path inferring
Sort
View
TKDE
2008
153views more  TKDE 2008»
13 years 7 months ago
Discovering Frequent Agreement Subtrees from Phylogenetic Data
We study a new data mining problem concerning the discovery of frequent agreement subtrees (FASTs) from a set of phylogenetic trees. A phylogenetic tree, or phylogeny, is an unorde...
Sen Zhang, Jason Tsong-Li Wang
WWW
2009
ACM
14 years 8 months ago
Click chain model in web search
Given a terabyte click log, can we build an efficient and effective click model? It is commonly believed that web search click logs are a gold mine for search business, because th...
Anitha Kannan, Chao Liu 0001, Christos Faloutsos, ...
IJCAI
1989
13 years 9 months ago
On the Declarative Semantics of Inheritance Networks
Usually, semantics of inheritance networks is specified indirectly through a translation into one of the standard logical formalisms. Since such translation involves an algorithmi...
Krishnaprasad Thirunarayan, Michael Kifer, David S...
SIGMOD
2010
ACM
207views Database» more  SIGMOD 2010»
13 years 8 months ago
Leveraging spatio-temporal redundancy for RFID data cleansing
Radio Frequency Identification (RFID) technologies are used in many applications for data collection. However, raw RFID readings are usually of low quality and may contain many an...
Haiquan Chen, Wei-Shinn Ku, Haixun Wang, Min-Te Su...
BMCBI
2010
142views more  BMCBI 2010»
13 years 8 months ago
pplacer: linear time maximum-likelihood and Bayesian phylogenetic placement of sequences onto a fixed reference tree
Background: Likelihood-based phylogenetic inference is generally considered to be the most reliable classification method for unknown sequences. However, traditional likelihood-ba...
Frederick A. Matsen III, Robin B. Kodner, E. Virgi...