Sciweavers

15 search results - page 1 / 3
» Kernelization and Sparseness: the Case of Dominating Set
Sort
View
ICML
2006
IEEE
14 years 5 months ago
Practical solutions to the problem of diagonal dominance in kernel document clustering
In supervised kernel methods, it has been observed that the performance of the SVM classifier is poor in cases where the diagonal entries of the Gram matrix are large relative to ...
Derek Greene, Padraig Cunningham
ICALP
2007
Springer
13 years 11 months ago
Linear Problem Kernels for NP-Hard Problems on Planar Graphs
Abstract. We develop a generic framework for deriving linear-size problem kernels for NP-hard problems on planar graphs. We demonstrate the usefulness of our framework in several c...
Jiong Guo, Rolf Niedermeier
IPPS
2002
IEEE
13 years 9 months ago
Dominating Set Based Bluetooth Scatternet Formation with Localized Maintenance
This paper addresses the problem of scatternet formation and maintenance for multi-hop Bluetooth based personal area and ad hoc networks with minimal communication overhead. Each ...
Ivan Stojmenovic
FGR
2006
IEEE
255views Biometrics» more  FGR 2006»
13 years 8 months ago
Incremental Kernel SVD for Face Recognition with Image Sets
Non-linear subspaces derived using kernel methods have been found to be superior compared to linear subspaces in modeling or classification tasks of several visual phenomena. Such...
Tat-Jun Chin, Konrad Schindler, David Suter
ICCS
2001
Springer
13 years 9 months ago
Optimizing Sparse Matrix Computations for Register Reuse in SPARSITY
Abstract. Sparse matrix-vector multiplication is an important computational kernel that tends to perform poorly on modern processors, largely because of its high ratio of memory op...
Eun-Jin Im, Katherine A. Yelick