Sciweavers

8 search results - page 2 / 2
» Lattices with Many Cycles Are Dense
Sort
View
HOTOS
1997
IEEE
13 years 9 months ago
Run-Time Code Generation as a Central System Service
We are building an operating system in which an integral run-time code generator constantly strives to improve the quality of already executing code. Our system is based on a plat...
Michael Franz
PR
2011
13 years 8 days ago
A sum-over-paths extension of edit distances accounting for all sequence alignments
This paper introduces a simple Sum-over-Paths (SoP) formulation of string edit distances accounting for all possible alignments between two sequences, and extends related previous...
Silvia García-Díez, François ...
SODA
1992
ACM
252views Algorithms» more  SODA 1992»
13 years 6 months ago
A General Approximation Technique for Constrained Forest Problems
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
Michel X. Goemans, David P. Williamson