3250 search results - page 362 / 650 » Parameterized Learning Complexity |
134
click to vote
ACSC
2005
IEEE
15 years 10 months ago
2005
IEEE
One approach to tractably finding a solution to an NP-complete optimisation problem is heuristic, where the solution is inexact but quickly found; another approach is to reduce t...
163
click to vote
FPGA
2005
ACM
15 years 10 months ago
2005
ACM
Floating-point Sparse Matrix-Vector Multiplication (SpMXV) is a key computational kernel in scientific and engineering applications. The poor data locality of sparse matrices sig...
162
click to vote
SBCCI
2003
ACM
15 years 10 months ago
2003
ACM
Unsupervised clustering is a powerful technique for understanding multispectral and hyperspectral images, being k-means one of the most used iterative approaches. It is a simple th...
127
Voted
ICALP
2003
Springer
15 years 10 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
151
click to vote
GMP
2002
IEEE
15 years 9 months ago
2002
IEEE
We present new results on classifying the morphology of the nonsingular intersection curve of two quadrics by studying the roots of the characteristic equation, or the discriminan...