7106 search results - page 194 / 1422 » Restricted Complexity, General Complexity |
254
Voted
ICDE
2008
IEEE
16 years 5 months ago
2008
IEEE
Abstract-- Simultaneously clustering columns and rows (coclustering) of large data matrix is an important problem with wide applications, such as document mining, microarray analys...
142
Voted
AI
2003
Springer
15 years 9 months ago
2003
Springer
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...
132
Voted
SPLC
2004
15 years 5 months ago
2004
This paper elaborates on the coordination and management of evolving software product-lines, where development teams work around a shared and reusable domain infrastructure. The tr...
158
Voted
SIAMSC
2010
14 years 10 months ago
2010
The fast Gauss transform allows for the calculation of the sum of N Gaussians at M points in O(N + M) time. Here, we extend the algorithm to a wider class of kernels, motivated by ...
143
Voted
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...