Sciweavers

2004 search results - page 6 / 401
» Sampling from large graphs
Sort
View
CORR
2008
Springer
130views Education» more  CORR 2008»
14 years 9 months ago
A Kernel Method for the Two-Sample Problem
We propose two statistical tests to determine if two samples are from different distributions. Our test statistic is in both cases the distance between the means of the two sample...
Arthur Gretton, Karsten M. Borgwardt, Malte J. Ras...
CVPR
2008
IEEE
15 years 11 months ago
Skeletal graphs for efficient structure from motion
We address the problem of efficient structure from motion for large, unordered, highly redundant, and irregularly sampled photo collections, such as those found on Internet photo-...
Noah Snavely, Steven M. Seitz, Richard Szeliski
SIGMETRICS
2008
ACM
115views Hardware» more  SIGMETRICS 2008»
14 years 9 months ago
Densification arising from sampling fixed graphs
During the past decade, a number of different studies have identified several peculiar properties of networks that arise from a diverse universe, ranging from social to computer n...
Pedram Pedarsani, Daniel R. Figueiredo, Matthias G...
109
Voted
TIP
2010
155views more  TIP 2010»
14 years 8 months ago
Laplacian Regularized D-Optimal Design for Active Learning and Its Application to Image Retrieval
—In increasingly many cases of interest in computer vision and pattern recognition, one is often confronted with the situation where data size is very large. Usually, the labels ...
Xiaofei He
ICCV
2009
IEEE
16 years 2 months ago
Domain Adaptive Semantic Diffusion for Large Scale Context-Based Video Annotation
Learning to cope with domain change has been known as a challenging problem in many real-world applications. This paper proposes a novel and efficient approach, named domain ada...
Yu-Gang Jiang, Jun Wang, Shih-Fu Chang, Chong-Wah ...