Sciweavers

3630 search results - page 162 / 726
» How to Compare Treebanks
Sort
View
KDD
2009
ACM
269views Data Mining» more  KDD 2009»
16 years 7 months ago
Frequent pattern mining with uncertain data
In this paper, we will examine the frequent pattern mining for uncertain data sets. We will show how the broad classes of algorithms can be extended to the uncertain data setting....
Charu C. Aggarwal, Yan Li, Jianyong Wang, Jing Wan...
172
Voted
CHI
2006
ACM
16 years 7 months ago
Getting the right design and the design right
We present a study comparing usability testing of a single interface versus three functionally equivalent but stylistically distinct designs. We found that when presented with a s...
Maryam Tohidi, William Buxton, Ronald Baecker, Abi...
POPL
2008
ACM
16 years 7 months ago
Extensible encoding of type hierarchies
The subtyping test consists of checking whether a type t is a descendant of a type r (Agrawal et al. 1989). We study how to perform such a test efficiently, assuming a dynamic hie...
Hamed Seiied Alavi, Seth Gilbert, Rachid Guerraoui
RECOMB
2001
Springer
16 years 7 months ago
Algorithms for phylogenetic footprinting
Phylogenetic footprinting is a comparative genomics approach for predicting transcription factor binding sites, where a set of orthologous regulatory regions are compared and short...
Mathieu Blanchette
RECOMB
2001
Springer
16 years 7 months ago
Analysis techniques for microarray time-series data
We address possible limitations of publicly available data sets of yeast gene expression. We study the predictability of known regulators via time-series analysis, and show that l...
Vladimir Filkov, Steven Skiena, Jizu Zhi