Sciweavers

232 search results - page 2 / 47
» On Characterizing the Data Access Complexity of Programs
Sort
View
ICPP
2008
IEEE
14 years 5 months ago
Parallelization and Characterization of Probabilistic Latent Semantic Analysis
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...
Chuntao Hong, Wenguang Chen, Weimin Zheng, Jiulong...
POPL
2006
ACM
14 years 11 months ago
A hierarchical model of data locality
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...
Chengliang Zhang, Chen Ding, Mitsunori Ogihara, Yu...
ICSM
1994
IEEE
14 years 3 months ago
A Change Analysis Process to Characterize Software Maintenance Projects
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...
Lionel C. Briand, Victor R. Basili, Yong-Mi Kim, D...
RECOMB
2006
Springer
14 years 11 months ago
A Study of Accessible Motifs and RNA Folding Complexity
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...
Ydo Wexler, Chaya Ben-Zaken Zilberstein, Michal Zi...
ANCS
2008
ACM
14 years 26 days ago
A remotely accessible network processor-based router for network experimentation
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...
Charlie Wiseman, Jonathan S. Turner, Michela Becch...