Sciweavers

7776 search results - page 1254 / 1556
» Maintaining Maintainability
Sort
View
POPL
2008
ACM
16 years 7 months ago
The design and implementation of typed scheme
When scripts in untyped languages grow into large programs, maintaining them becomes difficult. A lack of types in typical scripting languages means that programmers must (re)disc...
Sam Tobin-Hochstadt, Matthias Felleisen
POPL
2007
ACM
16 years 7 months ago
Cork: dynamic memory leak detection for garbage-collected languages
A memory leak in a garbage-collected program occurs when the program inadvertently maintains references to objects that it no longer needs. Memory leaks cause systematic heap grow...
Maria Jump, Kathryn S. McKinley
RECOMB
2005
Springer
16 years 7 months ago
RNA-RNA Interaction Prediction and Antisense RNA Target Search
Abstract. Recent studies demonstrating the existence of special non-coding "antisense" RNAs used in post-transcriptional gene regulation have received considerable attent...
Can Alkan, Emre Karakoç, Joseph H. Nadeau, ...
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
16 years 7 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
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
16 years 7 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi
« Prev « First page 1254 / 1556 Last » Next »