552 search results - page 30 / 111 » On the Complexity of Join Predicates |
114
Voted
BMCBI
2008
15 years 18 days ago
2008
Background: Inference of evolutionary trees using the maximum likelihood principle is NP-hard. Therefore, all practical methods rely on heuristics. The topological transformations...
105
Voted
FUIN
2010
14 years 9 months ago
2010
An infinite binary word can be identified with a branch in the full binary tree. We consider sets of branches definable in monadic second-order logic over the tree, where we allow ...
187
Voted
ICDE
2009
IEEE
16 years 2 months ago
2009
IEEE
We consider the problem of efficiently computing weighted proximity best-joins over multiple lists, with applications in information retrieval and extraction. We are given a multi-...
97
Voted
IJAR
2008
15 years 15 days ago
2008
Linear constraints occur naturally in many reasoning problems and the information that they represent is often uncertain. There is a difficulty in applying AI uncertainty formalis...
94
Voted
APCSAC
2003
IEEE
15 years 4 months ago
2003
IEEE
Very Long Instruction Word (VLIW) architectures exploit instruction level parallelism (ILP) with the help of the compiler to achieve higher instruction throughput with minimal hard...