Sciweavers

369 search results - page 66 / 74
» Scalable Bloom Filters
Sort
View
KDD
2002
ACM
145views Data Mining» more  KDD 2002»
14 years 8 months ago
Handling very large numbers of association rules in the analysis of microarray data
The problem of analyzing microarray data became one of important topics in bioinformatics over the past several years, and different data mining techniques have been proposed for ...
Alexander Tuzhilin, Gediminas Adomavicius
CIVR
2009
Springer
212views Image Analysis» more  CIVR 2009»
14 years 3 months ago
Video copy detection by fast sequence matching
Sequence matching techniques are effective for comparing two videos. However, existing approaches suffer from demanding computational costs and thus are not scalable for large-sca...
Mei-Chen Yeh, Kwang-Ting Cheng
CORR
2008
Springer
133views Education» more  CORR 2008»
13 years 8 months ago
Emergence of Spontaneous Order Through Neighborhood Formation in Peer-to-Peer Recommender Systems
The advent of the Semantic Web necessitates paradigm shifts away from centralized client/server architectures towards decentralization and peer-to-peer computation, making the exi...
Ernesto Diaz-Aviles, Lars Schmidt-Thieme, Cai-Nico...
SSDBM
2010
IEEE
133views Database» more  SSDBM 2010»
13 years 6 months ago
PrefIndex: An Efficient Supergraph Containment Search Technique
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
Gaoping Zhu, Xuemin Lin, Wenjie Zhang, Wei Wang, H...
ANCS
2009
ACM
13 years 6 months ago
Progressive hashing for packet processing using set associative memory
As the Internet grows, both the number of rules in packet filtering databases and the number of prefixes in IP lookup tables inside the router are growing. The packet processing e...
Michel Hanna, Socrates Demetriades, Sangyeun Cho, ...