Sciweavers

2297 search results - page 300 / 460
» A fast APRIORI implementation
Sort
View
TIP
2010
176views more  TIP 2010»
15 years 1 months ago
A PDE Formalization of Retinex Theory
In 1964 Edwin H. Land formulated the Retinex theory, the first attempt to simulate and explain how the human visual system perceives color. His theory and an extension, the "r...
Jean-Michel Morel, Ana Belen Petro, Catalina Sbert
IACR
2011
123views more  IACR 2011»
14 years 6 months ago
Hummingbird: Privacy at the time of Twitter
In the last several years, micro-blogging Online Social Networks (OSNs), such as Twitter, have taken the world by storm, now boasting over 100 million subscribers. As an unparalle...
Emiliano De Cristofaro, Claudio Soriente, Gene Tsu...
INFOCOM
2012
IEEE
13 years 9 months ago
The Variable-Increment Counting Bloom Filter
—Counting Bloom Filters (CBFs) are widely used in networking device algorithms. They implement fast set representations to support membership queries with limited error, and supp...
Ori Rottenstreich, Yossi Kanizo, Isaac Keslassy
TABLEAUX
2000
Springer
15 years 10 months ago
Benchmark Analysis with FaCT
FaCT (Fast Classification of Terminologies) is a Description Logic (DL) classifier that can also be used for modal logic satisfiability testing. The FaCT system includes two reason...
Ian Horrocks
DC
2010
15 years 6 months ago
Refined quorum systems
It is considered good distributed computing practice to devise object implementations that tolerate contention, periods of asynchrony and a large number of failures, but perform f...
Rachid Guerraoui, Marko Vukolic