Sciweavers

1715 search results - page 244 / 343
» How Space Structures Language
Sort
View
124
Voted
CAD
2005
Springer
15 years 2 months ago
Optimizing the topological and combinatorial complexity of isosurfaces
Since the publication of the original Marching Cubes algorithm, numerous variations have been proposed for guaranteeing water-tight constructions of triangulated approximations of...
Carlos Andújar, Pere Brunet, Antoni Chica, ...
180
Voted
ECOOP
2003
Springer
15 years 8 months ago
LeakBot: An Automated and Lightweight Tool for Diagnosing Memory Leaks in Large Java Applications
Despite Java’s automatic reclamation of memory, memory leaks remain an important problem. For example, we frequently encounter memory leaks that cause production servers to crash...
Nick Mitchell, Gary Sevitsky
125
Voted
ICFP
1999
ACM
15 years 7 months ago
Type Inference Builds a Short Cut to Deforestation
Deforestation optimises a functional program by transforming it into another one that does not create certain intermediate data structures. Short cut deforestation is a deforestat...
Olaf Chitil
116
Voted
JSS
2007
115views more  JSS 2007»
15 years 2 months ago
A case study in re-engineering to enforce architectural control flow and data sharing
Without rigorous software development and maintenance, software tends to lose its original architectural structure and become difficult to understand and modify. ArchJava, a recen...
Marwan Abi-Antoun, Jonathan Aldrich, Wesley Coelho
130
Voted
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
16 years 3 months ago
Lower bounds for dynamic connectivity
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...
Mihai Patrascu, Erik D. Demaine