Sciweavers

2382 search results - page 291 / 477
» Generating Seeded Trees from Data Sets
Sort
View
CIKM
2006
Springer
14 years 5 days ago
Efficiently clustering transactional data with weighted coverage density
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...
Hua Yan, Keke Chen, Ling Liu
BIBM
2009
IEEE
155views Bioinformatics» more  BIBM 2009»
14 years 5 months ago
Towards Reliable Isoform Quantification Using RNA-Seq Data
Background: In eukaryotes, alternative splicing often generates multiple splice variants from a single gene. Here weexplore the use of RNA sequencing (RNA-Seq) datasets to address...
Brian E. Howard, Steffen Heber
EMSOFT
2007
Springer
14 years 4 months ago
WCET estimation for executables in the presence of data caches
This paper describes techniques to estimate the worst case execution time of executable code on architectures with data caches. The underlying mechanism is Abstract Interpretation...
Rathijit Sen, Y. N. Srikant
TASE
2010
IEEE
13 years 5 months ago
Clear and Precise Specification of Ecological Data Management Processes and Dataset Provenance
Abstract--With the availability of powerful computational and communication systems, scientists now readily access large, complicated derived datasets and build on those results to...
Leon J. Osterweil, Lori A. Clarke, Aaron M. Elliso...
CORR
2002
Springer
142views Education» more  CORR 2002»
13 years 10 months ago
Learning Algorithms for Keyphrase Extraction
Many academic journals ask their authors to provide a list of about five to fifteen keywords, to appear on the first page of each article. Since these key words are often phrases ...
Peter D. Turney