Sciweavers

4155 search results - page 387 / 831
» External Memory Algorithms
Sort
View
194
Voted
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
16 years 8 days 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...
KDD
2008
ACM
161views Data Mining» more  KDD 2008»
16 years 7 months ago
Locality sensitive hash functions based on concomitant rank order statistics
: Locality Sensitive Hash functions are invaluable tools for approximate near neighbor problems in high dimensional spaces. In this work, we are focused on LSH schemes where the si...
Kave Eshghi, Shyamsundar Rajaram
SBCCI
2005
ACM
114views VLSI» more  SBCCI 2005»
16 years 1 months ago
Traffic generation and performance evaluation for mesh-based NoCs
The designer of a system on a chip (SoC) that connects IP cores through a network on chip (NoC) needs methods to support application performance evaluation. Two key aspects these ...
Leonel Tedesco, Aline Mello, Diego Garibotti, Ney ...
OOPSLA
2001
Springer
15 years 12 months ago
Regression Test Selection for Java Software
Regression testing is applied to modified software to provide confidence that the changed parts behave as intended and that the unchanged parts have not been adversely affected ...
Mary Jean Harrold, James A. Jones, Tongyu Li, Dong...
STOC
1996
ACM
185views Algorithms» more  STOC 1996»
15 years 11 months ago
Adaptively Secure Multi-Party Computation
A fundamental problem in designing secure multi-party protocols is how to deal with adaptive adversaries i.e., adversaries that may choose the corrupted parties during the course ...
Ran Canetti, Uriel Feige, Oded Goldreich, Moni Nao...