Sciweavers

4355 search results - page 215 / 871
» Increasing Kolmogorov Complexity
Sort
View
BMCBI
2006
98views more  BMCBI 2006»
14 years 11 months ago
Optimised amino acid specific weighting factors for unbound protein docking
Background: One of the most challenging aspects of protein-protein docking is the inclusion of flexibility into the docking procedure. We developed a postfilter where the grid-rep...
Philipp Heuser, Dietmar Schomburg
76
Voted
CORR
2006
Springer
120views Education» more  CORR 2006»
14 years 11 months ago
On the Role of Shared Entanglement
Despite the apparent similarity between shared randomness and shared entanglement in the context of Communication Complexity, our understanding of the latter is not as good as of ...
Dmitry Gavinsky
TON
2002
99views more  TON 2002»
14 years 10 months ago
Computing shortest paths for any number of hops
In this paper we introduce and investigate a new" path optimization problem which we denote as the All Hops Optimal Path AHOP problem. The problem involves identifying, for a...
Roch Guérin, Ariel Orda
97
Voted
EDBTW
2010
Springer
14 years 9 months ago
Using web-based personalization on spatial data warehouses
Spatial data warehouses (SDW) rely on extended multidimensional (MD) models in order to provide decision makers with appropriate structures to intuitively analyse spatial data. Se...
Octavio Glorio, Jose-Norberto Mazón, Irene ...
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
15 years 11 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking