Sciweavers

305 search results - page 35 / 61
» From Sets to Bits in Coq
Sort
View
DMIN
2007
158views Data Mining» more  DMIN 2007»
15 years 11 days ago
Mining Frequent Itemsets Using Re-Usable Data Structure
- Several algorithms have been introduced for mining frequent itemsets. The recent datasettransformation approach suffers either from the possible increasing in the number of struc...
Mohamed Yakout, Alaaeldin M. Hafez, Hussein Aly
89
Voted
ICMCS
2009
IEEE
130views Multimedia» more  ICMCS 2009»
14 years 8 months ago
On improving the collision property of robust hashing based on projections
In this paper, we study the collision property of one of the robust hash functions proposed in [1]. This method was originally proposed for robust hash generation from blocks of i...
Regunathan Radhakrishnan, Wenyu Jiang, Claus Bauer
SISAP
2011
IEEE
437views Data Mining» more  SISAP 2011»
14 years 1 months ago
Succinct nearest neighbor search
In this paper we present a novel technique for nearest neighbor searching dubbed neighborhood approximation. The central idea is to divide the database into compact regions repres...
Eric Sadit Tellez, Edgar Chávez, Gonzalo Na...
124
Voted
CISC
2005
Springer
169views Cryptology» more  CISC 2005»
15 years 4 months ago
On Bluetooth Repairing: Key Agreement Based on Symmetric-Key Cryptography
Abstract. Despite many good (secure) key agreement protocols based on publickey cryptography exist, secure associations between two wireless devices are often established using sym...
Serge Vaudenay
78
Voted
NSDI
2007
15 years 1 months ago
Exploiting Similarity for Multi-Source Downloads Using File Handprints
Many contemporary approaches for speeding up large file transfers attempt to download chunks of a data object from multiple sources. Systems such as BitTorrent quickly locate sou...
Himabindu Pucha, David G. Andersen, Michael Kamins...