Sciweavers

5473 search results - page 807 / 1095
» On the graph isomorphism problem
Sort
View
CVPR
2011
IEEE
15 years 2 months ago
Hyper-graph Matching via Reweighted Random Walks
Establishing correspondences between two feature sets is a fundamental issue in computer vision, pattern recognition, and machine learning. This problem can be well formulated as g...
Jungmin Lee (Seoul National University), Minsu Cho...
PAMI
2010
207views more  PAMI 2010»
15 years 1 months ago
Document Ink Bleed-Through Removal with Two Hidden Markov Random Fields and a Single Observation Field
We present a new method for blind document bleed through removal based on separate Markov Random Field (MRF) regularization for the recto and for the verso side, where separate pri...
Christian Wolf
CAV
2011
Springer
216views Hardware» more  CAV 2011»
14 years 10 months ago
Malware Analysis with Tree Automata Inference
Abstract. The underground malware-based economy is flourishing and it is evident that the classical ad-hoc signature detection methods are becoming insufficient. Malware authors ...
Domagoj Babic, Daniel Reynaud, Dawn Song
FGR
2011
IEEE
354views Biometrics» more  FGR 2011»
14 years 10 months ago
Hierarchical ranking of facial attributes
Abstract— We propose a novel hierarchical structured prediction approach for ranking images of faces based on attributes. We view ranking as a bipartite graph matching problem; l...
Ankur Datta, Rogerio Feris, Daniel A. Vaquero
INFOCOM
2011
IEEE
14 years 10 months ago
Multiple task scheduling for low-duty-cycled wireless sensor networks
—For energy conservation, a wireless sensor network is usually designed to work in a low-duty-cycle mode, in which a sensor node keeps active for a small percentage of time durin...
Shuguang Xiong, Jianzhong Li, Mo Li, Jiliang Wang,...