3891 search results - page 604 / 779 » Query Models |
101
click to vote
GCB
1997
Springer
15 years 7 months ago
1997
Springer
Motivation: Database search programs such as FASTA, BLAST or a rigorous Smith–Waterman algorithm produce lists of database entries, which are assumed to be related to the query....
136
click to vote
VLDB
1994
ACM
15 years 7 months ago
1994
ACM
We address the problem of finding parallel plans for SQL queries using the two-phase approach of join ordering followed by parallelization. We focus on the parallelization phase a...
131
click to vote
BPM
2006
Springer
15 years 6 months ago
2006
Springer
Many business solutions provide best practice process templates, both generic as well as for specific industry sectors. However, it is often the variance from template solutions th...
105
click to vote
DEXAW
2004
IEEE
15 years 6 months ago
2004
IEEE
The Web is moving to a new generation in which machine-understandable processing is mandatory. In order to achieve this goal it is essential to define ontologies which enable the ...
170
click to vote
CP
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. Inspired by AND/OR search spaces for graphical models recently introduced, we propose to augment Ordered Decision Diagrams with AND nodes, in order to capture function de...