4679 search results - page 65 / 936 » Modeling When Connections Are the Problem |
ISAAC
2007
Springer
15 years 7 months ago
2007
Springer
We design a faster algorithm for the k-maximum sub-array problem under the conventional RAM model, based on distance matrix multiplication (DMM). Specifically we achieve O(n3 log ...
117
click to vote
NIPS
2004
15 years 2 months ago
2004
In the multi-armed bandit problem, an online algorithm must choose from a set of strategies in a sequence of n trials so as to minimize the total cost of the chosen strategies. Wh...
115
click to vote
ICIP
2000
IEEE
16 years 3 months ago
2000
IEEE
We present an estimation-theoretic approach to curve evolution for the Mumford-Shah problem. By viewing an active contour as the set of discontinuities in the Mumford-Shah problem...
CPAIOR
2010
Springer
15 years 6 months ago
2010
Springer
Constrained Optimum Path (COP) problems arise in many real-life applications and are ubiquitous in communication networks. They have been traditionally approached by dedicated algo...
129
click to vote
EAAI
2008
15 years 1 months ago
2008
: In real life scenarios there is often the need for modelling conditional plans where external events determgine the actual execution sequence. Conditional Temporal Problems (CTPs...