16430 search results - page 268 / 3286 » On Computable Tree Functions |
154
click to vote
DAWAK
2003
Springer
15 years 9 months ago
2003
Springer
We introduce a new method for optimization of SQL queries with nested subqueries. The method is based on the idea of Boolean aggregates, aggregates that compute the conjunction or ...
145
click to vote
IPCO
2010
15 years 6 months ago
2010
Hypergraph multiway cut problem is a problem of finding a minimum capacity set of hyperedges whose removal divides a given hypergraph into a specified number of connected componen...
141
Voted
ACL
2001
15 years 6 months ago
2001
The standard pipeline approach to semantic processing, in which sentences are morphologically and syntactically resolved to a single tree before they are interpreted, is a poor fi...
136
click to vote
CMG
2001
15 years 6 months ago
2001
- The KDD (Knowledge Discovery in Databases) paradigm is a step by step process for finding interesting patterns in large amounts of data. Data mining is one step in the process. T...
122
click to vote
JPDC
2006
15 years 4 months ago
2006
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...