Sciweavers

656 search results - page 12 / 132
» Large-Graph Layout Algorithms at Work: An Experimental Study
Sort
View
IMC
2007
ACM
14 years 11 months ago
Acyclic type-of-relationship problems on the internet: an experimental analysis
An experimental study of the feasibility and accuracy of the acyclicity approach introduced in [14] for the inference of business relationships among autonomous systems (ASes) is ...
Benjamin Hummel, Sven Kosub
84
Voted
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
15 years 2 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...
PLDI
2006
ACM
15 years 3 months ago
An experimental analysis of self-adjusting computation
Dependence graphs and memoization can be used to efficiently update the output of a program as the input changes dynamically. Recent work has studied techniques for combining the...
Umut A. Acar, Guy E. Blelloch, Matthias Blume, Kan...
CCS
2008
ACM
14 years 11 months ago
Towards experimental evaluation of code obfuscation techniques
While many obfuscation schemes proposed, none of them satisfy any strong definition of obfuscation. Furthermore secure generalpurpose obfuscation algorithms have been proven to be...
Mariano Ceccato, Massimiliano Di Penta, Jasvir Nag...
AAAI
2007
14 years 12 months ago
On the Prospects for Building a Working Model of the Visual Cortex
Human visual capability has remained largely beyond the reach of engineered systems despite intensive study and considerable progress in problem understanding, algorithms and comp...
Thomas Dean, Glenn Carroll, Richard Washington