635 search results - page 78 / 127 » Some Computational Problems Related to Pseudo-intents |
ENTCS
2002
14 years 9 months ago
2002
Solovay showed that there are noncomputable reals such that H( n) H(1n) + O(1), where H is prefix-free Kolmogorov complexity. Such H-trivial reals are interesting due to the conn...
105
click to vote
FSTTCS
2010
Springer
14 years 7 months ago
2010
Springer
We study the computational complexity of basic decision problems for one-counter simple stochastic games (OC-SSGs), under various objectives. OC-SSGs are 2-player turn-based stoch...
DCOSS
2008
Springer
14 years 11 months ago
2008
Springer
This paper studies the problem of associating deterministically a track revealed by a binary sensor network with the trajectory of a unique moving anonymous object, namely the Mult...
117
click to vote
CVPR
2010
IEEE
15 years 2 months ago
2010
IEEE
The design of feature spaces for local image descriptors is an important research subject in computer vision due to its applicability in several problems, such as visual classifi...
EFDBS
2000
14 years 11 months ago
2000
Today, bibliographical information is kept in a variety of data sources world wide, some of them publically available, and some of them also offering information about citations m...