14165 search results - page 515 / 2833 » The generalized two-server problem |
197
click to vote
COMBINATORICS
2004
15 years 6 months ago
2004
In the 1960's, Tutte presented a decomposition of a 2-connected finite graph into 3-connected graphs, cycles and bonds. This decomposition has been used to reduce problems on...
197
click to vote
JAL
2002
15 years 6 months ago
2002
We study the computational problem "find the value of the quantified formula obtained by quantifying the variables in a sum of terms." The "sum" can be based o...
139
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We use a generalization of the Lindeberg principle developed by Sourav Chatterjee to prove universality properties for various problems in communications, statistical learning and...
152
click to vote
ICONIP
2009
15 years 4 months ago
2009
We study a subclass of POMDPs, called quasi-deterministic POMDPs (QDET-POMDPs), characterized by deterministic actions and stochastic observations. While this framework does not mo...
171
click to vote
ICCV
2003
IEEE
16 years 9 months ago
2003
IEEE
This paper presents a framework for finding point correspondences in monocular image sequences over multiple frames. The general problem of multi-frame point correspondence is NP ...