2127 search results - page 81 / 426 » Computing large matchings fast |
124
Voted
DLOG
2003
15 years 5 months ago
2003
Matching problems in Description Logics are theoretically well understood, with a variety of algorithms available for different DLs. Nevertheless, still no implementation of a ge...
159
Voted
VECPAR
2004
Springer
15 years 9 months ago
2004
Springer
Peer-to-peer (P2P) computing offers new opportunities for building highly distributed data systems. Unlike client-server computing, P2P can operate without central coordination and...
108
Voted
ICPR
2008
IEEE
16 years 4 months ago
2008
IEEE
In this paper, the matching of SIFT-like features [5] between images is studied. The goal is to decide which matches between descriptors of two datasets should be selected. This m...
152
Voted
CATA
2000
15 years 5 months ago
2000
We investigate a method to speed up the O(n3 ) labeling algorithm of Rosenfeld and Pfaltz for segmenting binary images, which is unduly complex for large images. That algorithm sea...
116
click to vote
DCC
2006
IEEE
16 years 3 months ago
2006
IEEE
In scientific computing environments, large amounts of floating-point data often need to be transferred between computers as well as to and from storage devices. Compression can r...