Sciweavers

1095 search results - page 83 / 219
» Preprocessing of Intractable Problems
Sort
View
SOFSEM
2005
Springer
14 years 3 months ago
Discovering Treewidth
Abstract. Treewidth is a graph parameter with several interesting theoretical and practical applications. This survey reviews algorithmic results on determining the treewidth of a ...
Hans L. Bodlaender
STACS
2005
Springer
14 years 3 months ago
Approximate Range Mode and Range Median Queries
Abstract. We consider data structures and algorithms for preprocessing a labelled list of length n so that, for any given indices i and j we can answer queries of the form: What is...
Prosenjit Bose, Evangelos Kranakis, Pat Morin, Yih...
GECCO
2004
Springer
105views Optimization» more  GECCO 2004»
14 years 3 months ago
An Enhanced Genetic Algorithm for DNA Sequencing by Hybridization with Positive and Negative Errors
Abstract. This paper describes a genetic algorithm for the DNA sequencing problem. The algorithm allows the input spectrum to contain both positive and negative errors as could be ...
Thang Nguyen Bui, Waleed A. Youssef
CPM
1999
Springer
93views Combinatorics» more  CPM 1999»
14 years 2 months ago
Pattern Matching in Text Compressed by Using Antidictionaries
In this paper we focus on the problem of compressed pattern matching for the text compression using antidictionaries, which is a new compression scheme proposed recently by Crochem...
Yusuke Shibata, Masayuki Takeda, Ayumi Shinohara, ...
FSTTCS
1998
Springer
14 years 1 months ago
Optimal Regular Tree Pattern Matching Using Pushdown Automata
Abstract. We propose a construction that augments the precomputation step of a regular tree pattern matching algorithm to include cost analysis. The matching device generated is a ...
Maya Madhavan, Priti Shankar