Sciweavers

447 search results - page 85 / 90
» Bounded Model Checking with Parametric Data Structures
Sort
View
BMCBI
2007
97views more  BMCBI 2007»
13 years 7 months ago
Relating destabilizing regions to known functional sites in proteins
Background: Most methods for predicting functional sites in protein 3D structures, rely on information on related proteins and cannot be applied to proteins with no known relative...
Benoit H. Dessailly, Marc F. Lensink, Shoshana J. ...
PODC
2005
ACM
14 years 1 months ago
Distance estimation and object location via rings of neighbors
We consider four problems on distance estimation and object location which share the common flavor of capturing global information via informative node labels: low-stretch routin...
Aleksandrs Slivkins
ISAAC
2005
Springer
111views Algorithms» more  ISAAC 2005»
14 years 1 months ago
Smoothed Analysis of Binary Search Trees
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
Bodo Manthey, Rüdiger Reischuk
UAI
2003
13 years 9 months ago
Strong Faithfulness and Uniform Consistency in Causal Inference
A fundamental question in causal inference is whether it is possible to reliably infer the manipulation effects from observational data. There are a variety of senses of asymptot...
Jiji Zhang, Peter Spirtes
CORR
2007
Springer
98views Education» more  CORR 2007»
13 years 7 months ago
Bistable Biorders: A Sequential Domain Theory
We give a simple order-theoretic construction of a Cartesian closed category of sequential functions. It is based on bistable biorders, which are sets with a partial order — the ...
James Laird