449 search results - page 74 / 90 » Distributed Reasoning in a Peer-to-Peer Setting |
178
click to vote
MM
2006
ACM
15 years 12 months ago
2006
ACM
The identification of near-duplicate keyframe (NDK) pairs is a useful task for a variety of applications such as news story threading and content-based video search. In this pape...
147
click to vote
AUSAI
2003
Springer
15 years 11 months ago
2003
Springer
An important task in machine learning is determining which learning algorithm works best for a given data set. When the amount of data is small the same data needs to be used repea...
215
click to vote
CIKM
1997
Springer
15 years 10 months ago
1997
Springer
The access patterns of the users of a web-site are traditionally analyzed in order to facilitate the user access to the site's information. In this study, however, a systemat...
196
click to vote
SODA
1993
ACM
15 years 7 months ago
1993
ACM
Given a set of n points in d-dimensional Euclidean space, S ⊂ Ed , and a query point q ∈ Ed , we wish to determine the nearest neighbor of q, that is, the point of S whose Euc...
193
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Milner's bigraphs [1] are a general framework for reasoning about distributed and concurrent programming languages. Notably, it has been designed to encompass both the -calcul...