Sciweavers

362 search results - page 1 / 73
» Kernelization through Tidying
Sort
View
LATIN
2010
Springer
13 years 11 months ago
Kernelization through Tidying
Abstract. We introduce the NP-hard graph-based data clustering problem s-Plex Cluster Vertex Deletion, where the task is to delete at most k vertices from a graph so that the conne...
René van Bevern, Hannes Moser, Rolf Niederm...
W4A
2006
ACM
13 years 10 months ago
Transforming web pages to become standard-compliant through reverse engineering
Developing Web pages following established standards can make the information more accessible, their rendering more efficient, and their processing by computer applications easier...
Benfeng Chen, Vincent Y. Shen
PAMI
2010
192views more  PAMI 2010»
13 years 3 months ago
Multiway Spectral Clustering with Out-of-Sample Extensions through Weighted Kernel PCA
—A new formulation for multiway spectral clustering is proposed. This method corresponds to a weighted kernel principal component analysis (PCA) approach based on primal-dual lea...
Carlos Alzate, Johan A. K. Suykens
SIGOPS
2008
170views more  SIGOPS 2008»
13 years 4 months ago
I/O resource management through system call scheduling
A principal challenge in operating system design is controlling system throughput and responsiveness while maximizing resource utilization. Unlike previous attempts in kernel reso...
Silviu S. Craciunas, Christoph M. Kirsch, Harald R...
ICPR
2010
IEEE
13 years 2 months ago
Improving Classification Accuracy by Comparing Local Features through Canonical Correlations
Classifying images using features extracted from densely sampled local patches has enjoyed significant success in many detection and recognition tasks. It is also well known that ...
Mert Dikmen, Thomas S. Huang