Sciweavers

2489 search results - page 274 / 498
» On the Subgroup Distance Problem
Sort
View
ACCV
2010
Springer
14 years 11 months ago
Pedestrian Recognition with a Learned Metric
This paper presents a new method for viewpoint invariant pedestrian recognition problem. We use a metric learning framework to obtain a robust metric for large margin nearest neigh...
Mert Dikmen, Emre Akbas, Thomas S. Huang, Narendra...
JMLR
2010
186views more  JMLR 2010»
14 years 11 months ago
Dimensionality Estimation, Manifold Learning and Function Approximation using Tensor Voting
We address instance-based learning from a perceptual organization standpoint and present methods for dimensionality estimation, manifold learning and function approximation. Under...
Philippos Mordohai, Gérard G. Medioni
TIT
2010
122views Education» more  TIT 2010»
14 years 11 months ago
Biological information as set-based complexity
The significant and meaningful fraction of all the potential information residing in the molecules and structures of living systems is unknown. Sets of random molecular sequences o...
David J. Galas, Matti Nykter, Gregory W. Carter, N...
CORR
2011
Springer
177views Education» more  CORR 2011»
14 years 8 months ago
Gossip PCA
Eigenvectors of data matrices play an important role in many computational problems, ranging from signal processing to machine learning and control. For instance, algorithms that ...
Satish Babu Korada, Andrea Montanari, Sewoong Oh
STOC
2009
ACM
155views Algorithms» more  STOC 2009»
16 years 5 months ago
A nearly optimal oracle for avoiding failed vertices and edges
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
Aaron Bernstein, David R. Karger