Sciweavers

3360 search results - page 400 / 672
» Opportunistic Data Structures with Applications
Sort
View
IPPS
2008
IEEE
16 years 20 days ago
Parallel mining of closed quasi-cliques
Graph structure can model the relationships among a set of objects. Mining quasi-clique patterns from large dense graph data makes sense with respect to both statistic and applica...
Yuzhou Zhang, Jianyong Wang, Zhiping Zeng, Lizhu Z...
ICMCS
2007
IEEE
144views Multimedia» more  ICMCS 2007»
16 years 17 days ago
A Framework for Modular Signal Processing Systems with High-Performance Requirements
This paper introduces the software framework MMER Lab which allows an effective assembly of modular signal processing systems optimized for memory efficiency and performance. Our...
Lukas Diduch, Ronald Müller, Gerhard Rigoll
MM
2009
ACM
249views Multimedia» more  MM 2009»
15 years 11 months ago
MyFinder: near-duplicate detection for large image collections
The explosive growth of multimedia data poses serious challenges to data storage, management and search. Efficient near-duplicate detection is one of the required technologies for...
Xin Yang, Qiang Zhu, Kwang-Ting Cheng
SP
1997
IEEE
163views Security Privacy» more  SP 1997»
15 years 10 months ago
Anonymous Connections and Onion Routing
Onion Routing is an infrastructure for private communication over a public network. It provides anonymous connections that are strongly resistant to both eavesdropping and tra c a...
Paul F. Syverson, David M. Goldschlag, Michael G. ...
EMMCVPR
1997
Springer
15 years 10 months ago
Deterministic Annealing for Unsupervised Texture Segmentation
Abstract. In this paper a rigorous mathematical framework of deterministic annealing and mean-field approximation is presented for a general class of partitioning, clustering and ...
Thomas Hofmann, Jan Puzicha, Joachim M. Buhmann