Sciweavers

1261 search results - page 185 / 253
» Approximation algorithms for aligning points
Sort
View
CCCG
2009
14 years 11 months ago
Defining and computing accessibility radius
In structural molecular biology software, the accessibility of an atom in a molecule to a ball representing solvent is either computed slowly by building a solventaccessible surfa...
Vishal Verma, Jack Snoeyink
BMCBI
2008
121views more  BMCBI 2008»
14 years 10 months ago
A simple and fast heuristic for protein structure comparison
Background: Protein structure comparison is a key problem in bioinformatics. There exist several methods for doing protein comparison, being the solution of the Maximum Contact Ma...
David A. Pelta, Juan Ramón González,...
ECCC
2007
185views more  ECCC 2007»
14 years 9 months ago
Trapdoors for Hard Lattices and New Cryptographic Constructions
We show how to construct a variety of “trapdoor” cryptographic tools assuming the worst-case hardness of standard lattice problems (such as approximating the length of the sho...
Craig Gentry, Chris Peikert, Vinod Vaikuntanathan
TSP
2008
102views more  TSP 2008»
14 years 9 months ago
Spatially Adaptive Estimation via Fitted Local Likelihood Techniques
Abstract--This paper offers a new technique for spatially adaptive estimation. The local likelihood is exploited for nonparametric modeling of observations and estimated signals. T...
Vladimir Katkovnik, Vladimir Spokoiny
KI
2007
Springer
14 years 9 months ago
Solving Decentralized Continuous Markov Decision Problems with Structured Reward
We present an approximation method that solves a class of Decentralized hybrid Markov Decision Processes (DEC-HMDPs). These DEC-HMDPs have both discrete and continuous state variab...
Emmanuel Benazera