1392 search results - page 122 / 279 » Dynamic Data Structure Analysis for Java Programs |
POPL
2000
ACM
15 years 2 months ago
2000
ACM
Many interactive Web services use the CGI interface for communication with clients. They will dynamically create HTML documents that are presented to the client who then resumes t...
KDD
2009
ACM
15 years 2 months ago
2009
ACM
Graphs or networks can be used to model complex systems. Detecting community structures from large network data is a classic and challenging task. In this paper, we propose a nove...
131
click to vote
IWMM
2011
Springer
14 years 22 days ago
2011
Springer
At the heart of all garbage collectors lies the process of identifying and processing reference fields within an object. Despite its key role, and evidence of many different impl...
IPPS
2005
IEEE
2005
IEEE
Building on a Framework: Using FG for More Flexibility and Improved Performance in Parallel Programs
15 years 3 months ago
We describe new features of FG that are designed to improve performance and extend the range of computations that fit into its framework. FG (short for Framework Generator) is a ...
STOC
2004
ACM
15 years 10 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...