1272 search results - page 115 / 255 » The Set Cover with Pairs Problem |
100
Voted
CVPR
2001
IEEE
16 years 2 months ago
2001
IEEE
We approach the problem of 2-D and 3-D puzzle solving by matching the geometric features of puzzle pieces three at a time. First, we define an affinity measure for a pair of piece...
88
Voted
WWW
2007
ACM
16 years 1 months ago
2007
ACM
Previous studies have highlighted the high arrival rate of new content on the web. We study the extent to which this new content can be efficiently discovered by a crawler. Our st...
96
Voted
SPAA
2003
ACM
15 years 6 months ago
2003
ACM
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of picking a routing between each pair of nodes (or a set of ows), without knowled...
165
click to vote
PVLDB
2010
14 years 7 months ago
2010
A string similarity join finds similar pairs between two collections of strings. It is an essential operation in many applications, such as data integration and cleaning, and has ...
92
Voted
DEXA
2009
Springer
15 years 7 months ago
2009
Springer
We solve the problem of record linkage between databases where record fields are mixed and permuted in different ways. The solution method uses a conditional random fields model...