Sciweavers

32 search results - page 5 / 7
» False Negative Problem of Counting Bloom Filter
Sort
View
VLDB
1998
ACM
111views Database» more  VLDB 1998»
13 years 11 months ago
Filtering with Approximate Predicates
Approximate predicates can be used to reduce the number of comparisons made by expensive, complex predicates. For example, to check if a point is within a region (expensive predic...
Narayanan Shivakumar, Hector Garcia-Molina, Chandr...
WWW
2007
ACM
14 years 8 months ago
Review spam detection
It is now a common practice for e-commerce Web sites to enable their customers to write reviews of products that they have purchased. Such reviews provide valuable sources of info...
Nitin Jindal, Bing Liu
SIGIR
2004
ACM
14 years 1 months ago
Evaluation of filtering current news search results
We describe an evaluation of result set filtering techniques for providing ultra-high precision in the task of presenting related news for general web queries. In this task, the n...
Steven M. Beitzel, Eric C. Jensen, Abdur Chowdhury...
TPDS
2010
126views more  TPDS 2010»
13 years 2 months ago
Stabilizing Distributed R-Trees for Peer-to-Peer Content Routing
Publish/subscribe systems provide useful platforms for delivering data (events) from publishers to subscribers in a decoupled fashion. Developing efficient publish/subscribe scheme...
Silvia Bianchi, Pascal Felber, Maria Gradinariu Po...
CN
2008
85views more  CN 2008»
13 years 7 months ago
Pollution attacks and defenses for Internet caching systems
Proxy caching servers are widely deployed in today's Internet. While cooperation among proxy caches can significantly improve a network's resilience to denial-ofservice ...
Leiwen Deng, Yan Gao, Yan Chen, Aleksandar Kuzmano...