2191 search results - page 260 / 439 » Improving the Efficiency of Non-Deterministic Computations |
145
click to vote
GCC
2005
Springer
15 years 11 months ago
2005
Springer
Web spider is a widely used approach to obtain information for search engines. As the size of the Web grows, it becomes a natural choice to parallelize the spider’s crawling proc...
158
click to vote
FC
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. This paper introduces certified sets to the private set intersection problem. A private set intersection protocol allows Alice and Bob to jointly compute the set intersec...
156
click to vote
CLEANDB
2006
ACM
15 years 10 months ago
2006
ACM
We consider the Entity Resolution (ER) problem (also known as deduplication, or merge-purge), in which records determined to represent the same real-world entity are successively ...
136
click to vote
ICCD
1991
IEEE
15 years 9 months ago
1991
IEEE
This article proposes a completion-detection method for efficiently implementing Boolean functions as self-timed logic structures. Current-Sensing Completion Detection, CSCD, allow...
181
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
We consider the problem of distributed exploration or coverage of an unknown environment by a swarm of mobile minirobots that have limited memory, computation and communication ca...