1092 search results - page 172 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
116
click to vote
ICML
2004
IEEE
16 years 2 months ago
2004
IEEE
Traditional non-parametric statistical learning techniques are often computationally attractive, but lack the same generalization and model selection abilities as state-of-the-art...
150
click to vote
DAGSTUHL
1996
15 years 3 months ago
1996
An analysis method for specialization of imperative programs is described in this paper. This analysis is an inter-procedural data flow method operating on control flow graphs and...
115
click to vote
TKDE
2008
15 years 1 months ago
2008
Schema matching is one of the key challenges in information integration. It is a labor-intensive and time-consuming process. To alleviate the problem, many automated solutions have...
104
click to vote
CIKM
2010
Springer
15 years 15 days ago
2010
Springer
Matrix factorization methods are among the most common techniques for detecting latent components in data. Popular examples include the Singular Value Decomposition or Nonnegative...
126
click to vote
PODS
2007
ACM
16 years 2 months ago
2007
ACM
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...