762 search results - page 15 / 153 » Finding SHA-1 Characteristics: General Results and Applicati... |
ICFP
2009
ACM
14 years 2 months ago
2009
ACM
We address the problem of testing and debugging concurrent, distributed Erlang applications. In concurrent programs, race conditions are a common class of bugs and are very hard t...
JCDL
2009
ACM
14 years 1 months ago
2009
ACM
We propose a generative model based on latent Dirichlet allocation for mining distinct topics in document collections by integrating the temporal ordering of documents into the ge...
ICDM
2007
IEEE
14 years 1 months ago
2007
IEEE
We present an extension to the Lasso [9] for binary classification problems with ordered attributes. Inspired by the Fused Lasso [8] and the Group Lasso [10, 4] models, we aim to...
COMPLEX
2009
Springer
14 years 1 months ago
2009
Springer
By introducing and analyzing a renormalization procedure, Song et al. [1] draw the conclusion that many complex networks exhibit self-repeating patterns on all length scales. First...
SIGMOD
2010
ACM
14 years 4 days ago
2010
ACM
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...