2877 search results - page 539 / 576 » The Complexity of Planarity Testing |
CPM
2005
Springer
14 years 1 days ago
2005
Springer
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
CLEF
2008
Springer
13 years 12 months ago
2008
Springer
In this paper we will describe Berkeley's approach to the Domain Specific (DS) track for CLEF 2008. Last year we used Entry Vocabulary Indexes and Thesaurus expansion approac...
BIOCOMP
2008
13 years 11 months ago
2008
Background: Inferring a gene regulatory network (GRN) from high throughput biological data is often an under-determined problem and is a challenging task due to the following reas...
CASCON
2007
13 years 11 months ago
2007
We present preliminary work on an IDE for formal software development using tabular expressions as the basis for precise specifications and descriptions of software behaviour. 1 ...
LREC
2010
13 years 11 months ago
2010
The increasing amount of available textual information makes necessary the use of Natural Language Processing (NLP) tools. These tools have to be used on large collections of docu...