232 search results - page 2 / 47 » On Characterizing the Data Access Complexity of Programs |
ICPP
2008
IEEE
13 years 11 months ago
2008
IEEE
Probabilistic Latent Semantic Analysis (PLSA) is one of the most popular statistical techniques for the analysis of two-model and co-occurrence data. It has applications in inform...
POPL
2006
ACM
14 years 5 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
ICSM
1994
IEEE
13 years 9 months ago
1994
IEEE
In order to improve software maintenance processes, we need to be able to first characterize and assess them. This task needs to be performed in depth and with objectivity since t...
RECOMB
2006
Springer
14 years 5 months ago
2006
Springer
mRNA molecules are folded in the cells and therefore many of their substrings may actually be inaccessible to protein and microRNA binding. The need to apply an accessability crite...
ANCS
2008
ACM
13 years 6 months ago
2008
ACM
Over the last decade, programmable Network Processors (NPs) have become widely used in Internet routers and other network components. NPs enable rapid development of complex packe...