Sciweavers

5046 search results - page 248 / 1010
» Feature Selection from Huge Feature Sets
Sort
View
EDBT
2009
ACM
175views Database» more  EDBT 2009»
16 years 1 months ago
Towards materialized view selection for distributed databases
Materialized views (MV) can significantly improve the query performance of relational databases. In this paper, we consider MVs to optimize complex scenarios where many heterogen...
Leonardo Weiss Ferreira Chaves, Erik Buchmann, Fab...
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
16 years 7 months ago
Sampling from large graphs
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
Jure Leskovec, Christos Faloutsos
CVPR
2003
IEEE
16 years 8 months ago
Wide-baseline Multiple-view Correspondences
We present a novel approach for establishing multiple-view feature correspondences along an unordered set of images taken from substantially different viewpoints. While recently s...
Vittorio Ferrari, Tinne Tuytelaars, Luc J. Van Goo...
ICIP
2010
IEEE
15 years 4 months ago
Towards computational models of kinship verification
We tackle the challenge of kinship verification using novel feature extraction and selection methods, automatically classifying pairs of face images as "related" or &quo...
Ruogu Fang, Kevin D. Tang, Noah Snavely, Tsuhan Ch...
IJCNN
2008
IEEE
16 years 1 months ago
Learning to select relevant perspective in a dynamic environment
— When an agent observes its environment, there are two important characteristics of the perceived information. One is the relevance of information and the other is redundancy. T...
Zhihui Luo, David A. Bell, Barry McCollum, Qingxia...