Sciweavers

243 search results - page 23 / 49
» On randomized representations of graphs using short labels
Sort
View
FGR
2011
IEEE
288views Biometrics» more  FGR 2011»
12 years 10 months ago
Facial action unit recognition with sparse representation
This paper presents a novel framework for recognition of facial action unit (AU) combinations by viewing the classification as a sparse representation problem. Based on this framew...
Mohammad H. Mahoor, Mu Zhou, Kevin L. Veon, Seyed ...
SIAMJO
2010
100views more  SIAMJO 2010»
13 years 2 months ago
Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
The sensor network localization, SNL , problem in embedding dimension r, consists of locating the positions of wireless sensors, given only the distances between sensors that are ...
Nathan Krislock, Henry Wolkowicz
COCO
2007
Springer
96views Algorithms» more  COCO 2007»
14 years 1 months ago
Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes
We give an improved explicit construction of highly unbalanced bipartite expander graphs with expansion arbitrarily close to the degree (which is polylogarithmic in the number of ...
Venkatesan Guruswami, Christopher Umans, Salil P. ...
CVPR
2008
IEEE
14 years 9 months ago
Combining appearance models and Markov Random Fields for category level object segmentation
Object models based on bag-of-words representations can achieve state-of-the-art performance for image classification and object localization tasks. However, as they consider obje...
Diane Larlus, Frédéric Jurie
GD
1998
Springer
13 years 11 months ago
Using Graph Layout to Visualize Train Interconnection Data
We consider the problem of visualizing interconnections in railway systems. Given time tables from systems with thousands of trains, we are to visualize basic properties of the co...
Ulrik Brandes, Dorothea Wagner