Sciweavers

11182 search results - page 351 / 2237
» Shape Analysis of Sets
Sort
View
BIOINFORMATICS
2006
92views more  BIOINFORMATICS 2006»
15 years 6 months ago
What should be expected from feature selection in small-sample settings
Motivation: High-throughput technologies for rapid measurement of vast numbers of biological variables offer the potential for highly discriminatory diagnosis and prognosis; howev...
Chao Sima, Edward R. Dougherty
PAMI
2007
217views more  PAMI 2007»
15 years 6 months ago
Discriminative Learning and Recognition of Image Set Classes Using Canonical Correlations
—We address the problem of comparing sets of images for object recognition, where the sets may represent variations in an object’s appearance due to changing camera pose and li...
Tae-Kyun Kim, Josef Kittler, Roberto Cipolla
TMC
2008
125views more  TMC 2008»
15 years 6 months ago
Distributed Algorithm for Efficient Construction and Maintenance of Connected k-Hop Dominating Sets in Mobile Ad Hoc Networks
A k-hop dominating set is a subset of nodes such that each node not in the set can be reached within k hops from at least one node in the set. A connected k-hop dominating set can ...
Hong-Yen Yang, Chia-Hung Lin, Ming-Jer Tsai
KDD
2003
ACM
180views Data Mining» more  KDD 2003»
16 years 7 months ago
Classifying large data sets using SVMs with hierarchical clusters
Support vector machines (SVMs) have been promising methods for classification and regression analysis because of their solid mathematical foundations which convey several salient ...
Hwanjo Yu, Jiong Yang, Jiawei Han
COMPGEOM
2009
ACM
16 years 1 months ago
Near-linear approximation algorithms for geometric hitting sets
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...
Pankaj K. Agarwal, Esther Ezra, Micha Sharir