Sciweavers

185 search results - page 34 / 37
» Latent Fingerprint Matching
Sort
View
KDD
2004
ACM
145views Data Mining» more  KDD 2004»
14 years 13 days ago
A graph-theoretic approach to extract storylines from search results
We present a graph-theoretic approach to discover storylines from search results. Storylines are windows that offer glimpses into interesting themes latent among the top search re...
Ravi Kumar, Uma Mahadevan, D. Sivakumar
UAI
2004
13 years 8 months ago
A Hierarchical Graphical Model for Record Linkage
The task of matching co-referent records is known among other names as record linkage. For large record-linkage problems, often there is little or no labeled data available, but u...
Pradeep D. Ravikumar, William W. Cohen
CVPR
2011
IEEE
13 years 4 months ago
Learning Better Image Representations Using 'Flobject Analysis'
Unsupervised learning can be used to extract image representations that are useful for various and diverse vision tasks. After noticing that most biological vision systems for int...
Inmar Givoni, Patrick Li, Brendan Frey
PAMI
2012
11 years 9 months ago
Probabilistic Models for Inference about Identity
—Many face recognition algorithms use “distance-based” methods: Feature vectors are extracted from each face and distances in feature space are compared to determine matches....
Simon Prince, Peng Li, Yun Fu, Umar Mohammed, Jame...
KDD
2012
ACM
212views Data Mining» more  KDD 2012»
11 years 9 months ago
Factoring past exposure in display advertising targeting
Online advertising is increasingly becoming more performance oriented, where the decision to show an advertisement to a user is made based on the user’s propensity to respond to...
Neha Gupta, Abhimanyu Das, Sandeep Pandey, Vijay K...