2356 search results - page 201 / 472 » Characterizations of postman sets |
166
click to vote
COCO
2004
Springer
16 years 1 days ago
2004
Springer
This paper develops new relationships between resource-bounded dimension, entropy rates, and compression. New tools for calculating dimensions are given and used to improve previo...
183
click to vote
ISTCS
1997
Springer
15 years 10 months ago
1997
Springer
We introduce the k-payment problem: given a total budget of N units, the problem is to represent this budget as a set of coins, so that any k exact payments of total value at most ...
205
click to vote
CIVR
2004
Springer
15 years 10 months ago
2004
Springer
Earlier this year, a major effort was initiated to study the theoretical and empirical aspects of the automatic detection of semantic concepts in broadcast video, complementing ong...
236
click to vote
BMCBI
2006
15 years 6 months ago
2006
Background: The number of sequences compiled in many genome projects is growing exponentially, but most of them have not been characterized experimentally. An automatic annotation...
168
click to vote
AMAI
1999
Springer
15 years 6 months ago
1999
Springer
Temporal Constraint Satisfaction Problems (TCSP) is a well known approach for representing and processing temporal knowledge. Important properties of the knowledge can be inferred...