Sciweavers

604 search results - page 77 / 121
» The Hardness of Metric Labeling
Sort
View
CVPR
2012
IEEE
11 years 10 months ago
Geodesic flow kernel for unsupervised domain adaptation
In real-world applications of visual recognition, many factors—such as pose, illumination, or image quality—can cause a significant mismatch between the source domain on whic...
Boqing Gong, Yuan Shi, Fei Sha, Kristen Grauman
WWW
2009
ACM
14 years 2 months ago
StatSnowball: a statistical approach to extracting entity relationships
Traditional relation extraction methods require pre-specified relations and relation-specific human-tagged examples. Bootstrapping systems significantly reduce the number of tr...
Jun Zhu, Zaiqing Nie, Xiaojiang Liu, Bo Zhang, Ji-...
APPROX
2009
Springer
195views Algorithms» more  APPROX 2009»
14 years 2 months ago
Approximating Node-Connectivity Augmentation Problems
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
Zeev Nutov
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
12 years 10 months ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...
CVPR
2009
IEEE
15 years 3 months ago
Locally Time-Invariant models of Human Activities using Trajectories on the Grassmanian
Human activity analysis is an important problem in computer vision with applications in surveillance and summarization and indexing of consumer content. Complex human activities...
Pavan Turaga, Rama Chellappa