Sciweavers

7839 search results - page 1487 / 1568
» What's News, What's Not
Sort
View
ECCC
2006
116views more  ECCC 2006»
13 years 10 months ago
Uniform Hardness Amplification in NP via Monotone Codes
We consider the problem of amplifying uniform average-case hardness of languages in NP, where hardness is with respect to BPP algorithms. We introduce the notion of monotone error...
Joshua Buresh-Oppenheim, Valentine Kabanets, Rahul...
ECCC
2006
88views more  ECCC 2006»
13 years 10 months ago
Hardness of Directed Routing with Congestion
Given a graph G and a collection of source-sink pairs in G, what is the least integer c such that each source can be connected by a path to its sink, with at most c paths going th...
Julia Chuzhoy, Sanjeev Khanna
ENTCS
2006
138views more  ENTCS 2006»
13 years 10 months ago
Variables as Resource in Separation Logic
Separation logic [20,21,14] began life as an extended formalisation of Burstall's treatment of list-mutating programs [8]. It rapidly became clear that there was more that it...
Richard Bornat, Cristiano Calcagno, Hongseok Yang
ENVSOFT
2006
131views more  ENVSOFT 2006»
13 years 10 months ago
Hydrological models are so good, do we still need data?
Our ability to numerically model natural systems has progressed enormously over the last 10e20 years. During the last decade computational power has increased to the stage where w...
R. P. Silberstein
BMCBI
2007
124views more  BMCBI 2007»
13 years 10 months ago
BranchClust: a phylogenetic algorithm for selecting gene families
Background: Automated methods for assembling families of orthologous genes include those based on sequence similarity scores and those based on phylogenetic approaches. The first ...
Maria S. Poptsova, J. Peter Gogarten
« Prev « First page 1487 / 1568 Last » Next »