Sciweavers

216 search results - page 35 / 44
» Self Assembling Graphs
Sort
View
POPL
2009
ACM
14 years 10 months ago
Automated verification of practical garbage collectors
Garbage collectors are notoriously hard to verify, due to their lowlevel interaction with the underlying system and the general difficulty in reasoning about reachability in graph...
Chris Hawblitzel, Erez Petrank
ICTAI
2009
IEEE
14 years 4 months ago
EBLearn: Open-Source Energy-Based Learning in C++
Energy-based learning (EBL) is a general framework to describe supervised and unsupervised training methods for probabilistic and non-probabilistic factor graphs. An energy-based ...
Pierre Sermanet, Koray Kavukcuoglu, Yann LeCun
PASTE
2005
ACM
14 years 3 months ago
LANCET: a nifty code editing tool
This paper presents Lancet, a multi-platform software visualization tool that enables the inspection of programs at the binary code level. Implemented on top of the linktime rewri...
Ludo Van Put, Bjorn De Sutter, Matias Madou, Bruno...
DNA
2001
Springer
125views Bioinformatics» more  DNA 2001»
14 years 2 months ago
PNA-mediated Whiplash PCR
The directed evolution of proteins, using an in vitro domainal shuffling strategy was proposed in (J. Kolkman and W. Stemmer, Nat. Biotech. 19, 423 (2001). Due to backhybridization...
John A. Rose, Russell J. Deaton, Masami Hagiya, Ak...
ICALP
2007
Springer
14 years 4 months ago
Low Distortion Spanners
A spanner of an undirected unweighted graph is a subgraph that approximates the distance metric of the original graph with some specified accuracy. Specifically, we say H ⊆ G i...
Seth Pettie