Sciweavers

596 search results - page 79 / 120
» Complexity Analysis by Graph Rewriting
Sort
View
PLDI
2003
ACM
14 years 1 months ago
Linear analysis and optimization of stream programs
As more complex DSP algorithms are realized in practice, an increasing need for high-level stream abstractions that can be compiled without sacrificing efficiency. Toward this en...
Andrew A. Lamb, William Thies, Saman P. Amarasingh...
KDD
2007
ACM
184views Data Mining» more  KDD 2007»
14 years 8 months ago
Dynamic hybrid clustering of bioinformatics by incorporating text mining and citation analysis
To unravel the concept structure and dynamics of the bioinformatics field, we analyze a set of 7401 publications from the Web of Science and MEDLINE databases, publication years 1...
Bart De Moor, Frizo A. L. Janssens, Wolfgang Gl&au...
BMCBI
2008
119views more  BMCBI 2008»
13 years 8 months ago
A new method for 2D gel spot alignment: application to the analysis of large sample sets in clinical proteomics
Background: In current comparative proteomics studies, the large number of images generated by 2D gels is currently compared using spot matching algorithms. Unfortunately, differe...
Sabine Pérès, Laurence Molina, Nicol...
DIS
2009
Springer
13 years 12 months ago
Discovering Influential Nodes for SIS Models in Social Networks
We address the problem of efficiently discovering the influential nodes in a social network under the susceptible/infected/susceptible (SIS) model, a diffusion model where nodes ar...
Kazumi Saito, Masahiro Kimura, Hiroshi Motoda
CRYPTO
2006
Springer
92views Cryptology» more  CRYPTO 2006»
13 years 11 months ago
Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs
In this paper we formalize a general model of cryptanalytic time/memory tradeoffs for the inversion of a random function f : {0, 1, . . . , N - 1} {0, 1, . . . , N - 1}. The model...
Elad Barkan, Eli Biham, Adi Shamir