2127 search results - page 151 / 426 » Computing large matchings fast |
144
click to vote
KDD
2006
ACM
16 years 4 months ago
2006
ACM
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
141
click to vote
CVPR
2008
IEEE
16 years 6 months ago
2008
IEEE
Matching articulated shapes represented by voxel-sets reduces to maximal sub-graph isomorphism when each set is described by a weighted graph. Spectral graph theory can be used to...
145
click to vote
WWW
2009
ACM
16 years 4 months ago
2009
ACM
Ad auctions in sponsored search support"broad match"that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving mo...
128
click to vote
BMCBI
2010
15 years 4 months ago
2010
Background: Whole-genome sequence alignment is an essential process for extracting valuable information about the functions, evolution, and peculiarities of genomes under investig...
146
click to vote
ECCV
2002
Springer
16 years 6 months ago
2002
Springer
There has been considerable success in automated reconstruction for image sequences where small baseline algorithms can be used to establish matches across a number of images. In c...