Sciweavers

712 search results - page 55 / 143
» A mixture model for random graphs
Sort
View
IEEEIAS
2007
IEEE
14 years 4 months ago
Generative Models for Fingerprint Individuality using Ridge Types
Generative models of pattern individuality attempt to represent the distribution of observed quantitative features, e.g., by learning parameters from a database, and then use such...
Gang Fang, Sargur N. Srihari, Harish Srinivasan
CIKM
2008
Springer
14 years 5 days ago
Dr. Searcher and Mr. Browser: a unified hyperlink-click graph
We introduce a unified graph representation of the Web, which includes both structural and usage information. We model this graph using a simple union of the Web's hyperlink ...
Barbara Poblete, Carlos Castillo, Aristides Gionis
CPC
2006
116views more  CPC 2006»
13 years 10 months ago
Finding Large Independent Sets in Polynomial Expected Time
We consider instances of the maximum independent set problem that are constructed according to the following semirandom model. Let Gn,p be a random graph, and let S be a set consis...
Amin Coja-Oghlan
PAMI
1998
107views more  PAMI 1998»
13 years 9 months ago
Graph Matching With a Dual-Step EM Algorithm
—This paper describes a new approach to matching geometric structure in 2D point-sets. The novel feature is to unify the tasks of estimating transformation geometry and identifyi...
Andrew D. J. Cross, Edwin R. Hancock
ICDM
2009
IEEE
112views Data Mining» more  ICDM 2009»
14 years 4 months ago
Resolving Identity Uncertainty with Learned Random Walks
A pervasive problem in large relational databases is identity uncertainty which occurs when multiple entries in a database refer to the same underlying entity in the world. Relati...
Ted Sandler, Lyle H. Ungar, Koby Crammer