Sciweavers

1759 search results - page 274 / 352
» Distributed Paging
Sort
View
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
15 years 7 months ago
Finding maximal cliques in massive networks by H*-graph
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...
SIGMOD
2010
ACM
153views Database» more  SIGMOD 2010»
15 years 7 months ago
Threshold query optimization for uncertain data
The probabilistic threshold query (PTQ) is one of the most common queries in uncertain databases, where all results satisfying the query with probabilities that meet the threshold...
Yinian Qi, Rohit Jain, Sarvjeet Singh, Sunil Prabh...
SIGMOD
2010
ACM
260views Database» more  SIGMOD 2010»
15 years 7 months ago
Towards proximity pattern mining in large graphs
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
Arijit Khan, Xifeng Yan, Kun-Lung Wu
CIVR
2010
Springer
199views Image Analysis» more  CIVR 2010»
15 years 7 months ago
Unsupervised multi-feature tag relevance learning for social image retrieval
Interpreting the relevance of a user-contributed tag with respect to the visual content of an image is an emerging problem in social image retrieval. In the literature this proble...
Xirong Li, Cees G. M. Snoek, Marcel Worring
GECCO
2010
Springer
155views Optimization» more  GECCO 2010»
15 years 7 months ago
Negative selection algorithms without generating detectors
Negative selection algorithms are immune-inspired classifiers that are trained on negative examples only. Classification is performed by generating detectors that match none of ...
Maciej Liskiewicz, Johannes Textor