3758 search results - page 260 / 752 » A Complete Subsumption Algorithm |
293
click to vote
POPL
2009
ACM
16 years 7 months ago
2009
ACM
We propose a new verification method for temporal properties of higher-order functional programs, which takes advantage of Ong's recent result on the decidability of the mode...
242
click to vote
SIGMOD
2005
ACM
16 years 6 months ago
2005
ACM
One of the most common operations in analytic query processing is the application of an aggregate function to the result of a relational join. We describe an algorithm for computi...
206
click to vote
MOBIHOC
2002
ACM
16 years 6 months ago
2002
ACM
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
156
click to vote
GLOBECOM
2009
IEEE
16 years 1 months ago
2009
IEEE
— In this paper, we study the anonymous cardinality estimation problem in radio frequency identification (RFID) systems. To preserve privacy and anonymity, each tag only transmi...
137
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
Traditionally, collaborative filtering (CF) algorithms used for recommendation operate on complete knowledge. This makes these algorithms hard to employ in a decentralized contex...