Sciweavers

876 search results - page 162 / 176
» New Results for the Martin Polynomial
Sort
View
POPL
2003
ACM
14 years 7 months ago
Interprocedural compatibility analysis for static object preallocation
We present an interprocedural and compositional algorithm for finding pairs of compatible allocation sites, which have the property that no object allocated at one site is live at...
Ovidiu Gheorghioiu, Alexandru Salcianu, Martin C. ...
OSDI
2004
ACM
14 years 7 months ago
Enhancing Server Availability and Security Through Failure-Oblivious Computing
We present a new technique, failure-oblivious computing, that enables servers to execute through memory errors without memory corruption. Our safe compiler for C inserts checks th...
Martin C. Rinard, Cristian Cadar, Daniel Dumitran,...
INFOCOM
2009
IEEE
14 years 2 months ago
Using NEMO to Support the Global Reachability of MANET Nodes
—Mobile Ad hoc Network (MANET) routing protocols have been the focus of an accomplished research effort for many years within the networking community and now the results of this...
Ben McCarthy, Christopher Edwards, Martin Dunmore
WADS
2007
Springer
180views Algorithms» more  WADS 2007»
14 years 1 months ago
Spanners for Geometric Intersection Graphs
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
Martin Fürer, Shiva Prasad Kasiviswanathan
CSB
2005
IEEE
135views Bioinformatics» more  CSB 2005»
14 years 1 months ago
Inverse Design of Large Molecules using Linear Diophantine Equations
We have previously developed a method [1] for the inverse design of small ligands. This method can be used to design novel compounds with optimized properties (such as drugs) and ...
Shawn Martin, W. Michael Brown, Jean-Loup Faulon, ...