3269 search results - page 587 / 654 » Query Optimization for XML |
115
click to vote
JALC
2007
15 years 2 months ago
2007
We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...
121
click to vote
CIKM
2010
Springer
15 years 1 months ago
2010
Springer
Term-weighting functions derived from various models of retrieval aim to model human notions of relevance more accurately. However, there is a lack of analysis of the sources of e...
129
click to vote
SSDBM
2010
IEEE
15 years 10 days ago
2010
IEEE
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
152
Voted
CORR
2010
Springer
14 years 12 months ago
2010
Springer
Abstract. CAT(0) metric spaces constitute a far-reaching common generalization of Euclidean and hyperbolic spaces and simple polygons: any two points x and y of a CAT(0) metric spa...
182
Voted
BMCBI
2011
14 years 6 months ago
2011
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...