4843 search results - page 776 / 969 » The Shortcut Problem - Complexity and Approximation |
119
click to vote
BMCBI
2010
15 years 3 months ago
2010
Background: The problem of determining the physical conformation of a protein dimer, given the structures of the two interacting proteins in their unbound state, is a difficult on...
153
Voted
CIKM
2010
Springer
15 years 2 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
162
Voted
ICRA
2009
IEEE
15 years 1 months ago
2009
IEEE
In Simultaneous Localisation and Mapping (SLAM), it is well known that probabilistic filtering approaches which aim to estimate the robot and map state sequentially suffer from poo...
125
Voted
IJAR
2010
15 years 23 days ago
2010
In this paper we present TANC, i.e., a tree-augmented naive credal classifier based on imprecise probabilities; it models prior near-ignorance via the Extreme Imprecise Dirichlet ...
175
Voted
TIT
2010
14 years 10 months ago
2010
Motivated by a recent surge of interest in convex optimization techniques, convexity/concavity properties of error rates of the maximum likelihood detector operating in the AWGN ch...