Sciweavers

2715 search results - page 268 / 543
» Total Generalized Variation
Sort
View
TMC
2012
13 years 6 months ago
A Statistical Mechanics-Based Framework to Analyze Ad Hoc Networks with Random Access
—Characterizing the performance of ad hoc networks is one of the most intricate open challenges; conventional ideas based on information-theoretic techniques and inequalities hav...
Sunil Srinivasa, Martin Haenggi
SODA
2010
ACM
397views Algorithms» more  SODA 2010»
16 years 1 months ago
Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
Aaron Archer, Anna Blasiak
CVPR
2009
IEEE
16 years 11 months ago
Implicit Elastic Matching with Random Projections for Pose-variant Face Recognition
We present a new approach to robust pose-variant face recognition, which exhibits excellent generalization ability even across completely different datasets due to its weak depe...
John Wright (University of Illinois), Gang Hua (Mi...
CVPR
2006
IEEE
16 years 6 months ago
Joint Boosting Feature Selection for Robust Face Recognition
A fundamental challenge in face recognition lies in determining what facial features are important for the identification of faces. In this paper, a novel face recognition framewo...
Rong Xiao, Wu-Jun Li, Yuandong Tian, Xiaoou Tang
PODC
2009
ACM
16 years 4 months ago
Brief announcement: minimum spanning trees and cone-based topology control
Consider a setting where nodes can vary their transmission power thereby changing the network topology, the goal of topology control is to reduce the transmission power while ensu...
Alejandro Cornejo, Nancy A. Lynch