Sciweavers

16088 search results - page 3066 / 3218
» A Mean-Variance Optimization algorithm
Sort
View
POPL
2007
ACM
16 years 6 months ago
Preferential path profiling: compactly numbering interesting paths
Path profiles provide a more accurate characterization of a program's dynamic behavior than basic block or edge profiles, but are relatively more expensive to collect. This h...
Kapil Vaswani, Aditya V. Nori, Trishul M. Chilimbi
POPL
2003
ACM
16 years 6 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. ...
RECOMB
2007
Springer
16 years 6 months ago
Pairwise Global Alignment of Protein Interaction Networks by Matching Neighborhood Topology
We describe an algorithm, IsoRank, for global alignment of two protein-protein interaction (PPI) networks. IsoRank aims to maximize the overall match between the two networks; in c...
Rohit Singh, Jinbo Xu, Bonnie Berger
RECOMB
2004
Springer
16 years 6 months ago
The evolutionary capacity of protein structures
In nature, one finds large collections of different protein sequences exhibiting roughly the same three-dimensional structure, and this observation underpins the study of structur...
Leonid Meyerguz, David Kempe, Jon M. Kleinberg, Ro...
STOC
2007
ACM
111views Algorithms» more  STOC 2007»
16 years 6 months ago
Low-end uniform hardness vs. randomness tradeoffs for AM
In 1998, Impagliazzo and Wigderson [IW98] proved a hardness vs. randomness tradeoff for BPP in the uniform setting, which was subsequently extended to give optimal tradeoffs for t...
Ronen Shaltiel, Christopher Umans
« Prev « First page 3066 / 3218 Last » Next »