Sciweavers

443 search results - page 49 / 89
» More on the Size of Higman-Haines Sets: Effective Constructi...
Sort
View
ICASSP
2011
IEEE
12 years 11 months ago
A new speaker identification algorithm for gaming scenarios
Speaker identification is a well-established research problem but has not been a major application used in gaming scenarios. In this paper, we propose a new algorithm for the ope...
Hoang Do, Ivan Tashev, Alex Acero
TOIS
2002
97views more  TOIS 2002»
13 years 7 months ago
Burst tries: a fast, efficient data structure for string keys
Many applications depend on efficient management of large sets of distinct strings in memory. For example, during index construction for text databases a record is held for each d...
Steffen Heinz, Justin Zobel, Hugh E. Williams
ISPD
2003
ACM
121views Hardware» more  ISPD 2003»
14 years 26 days ago
Optimality, scalability and stability study of partitioning and placement algorithms
This paper studies the optimality, scalability and stability of stateof-the-art partitioning and placement algorithms. We present algorithms to construct two classes of benchmarks...
Jason Cong, Michail Romesis, Min Xie
BMCBI
2011
13 years 2 months ago
Assessing the benefits of using mate-pairs to resolve repeats in de novo short-read prokaryotic assemblies
Background: Next-generation sequencing technologies allow genomes to be sequenced more quickly and less expensively than ever before. However, as sequencing technology has improve...
Joshua Wetzel, Carl Kingsford, Mihai Pop
WOB
2008
128views Bioinformatics» more  WOB 2008»
13 years 9 months ago
Tests for Gene Clusters Satisfying the Generalized Adjacency Criterion
Abstract. We study a parametrized definition of gene clusters that permits control over the trade-off between increasing gene content versus conserving gene order within a cluster....
Ximing Xu, David Sankoff