Sciweavers

1656 search results - page 320 / 332
» Labeling Schemes with Queries
Sort
View
TKDE
2010
148views more  TKDE 2010»
13 years 6 months ago
False Negative Problem of Counting Bloom Filter
—Bloom filter is effective, space-efficient data structure for concisely representing a data set and supporting approximate membership queries. Traditionally, researchers often b...
Deke Guo, Yunhao Liu, Xiang-Yang Li, Panlong Yang
PVLDB
2010
111views more  PVLDB 2010»
13 years 2 months ago
Net-Fli: On-the-fly Compression, Archiving and Indexing of Streaming Network Traffic
The ever-increasing number of intrusions in public and commercial networks has created the need for high-speed archival solutions that continuously store streaming network data to...
Francesco Fusco, Marc Ph. Stoecklin, Michail Vlach...
ICASSP
2011
IEEE
12 years 11 months ago
Rapid image retrieval for mobile location recognition
Recognizing the location and orientation of a mobile device from captured images is a promising application of image retrieval algorithms. Matching the query images to an existing...
Georg Schroth, Anas Al-Nuaimi, Robert Huitl, Flori...
SIGIR
2011
ACM
12 years 10 months ago
Functional matrix factorizations for cold-start recommendation
A key challenge in recommender system research is how to effectively profile new users, a problem generally known as cold-start recommendation. Recently the idea of progressivel...
Ke Zhou, Shuang-Hong Yang, Hongyuan Zha
IACR
2011
106views more  IACR 2011»
12 years 7 months ago
Hash Functions Based on Three Permutations: A Generic Security Analysis
We consider the family of 2n-to-n-bit compression functions that are solely based on at most three permutation executions and on XOR-operators, and analyze its collision and preima...
Bart Mennink, Bart Preneel