13306 search results - page 328 / 2662 » Theoretical Computer Science |
203
click to vote
GI
2004
Springer
16 years 2 days ago
2004
Springer
: We present our idea of solving parts of the vision task with an organic computing approach. We have designed a multiagent system (MAS) of many different modules working on differ...
155
click to vote
MFCS
1993
Springer
15 years 10 months ago
1993
Springer
We present the different constructive definitions of real number that can be found in the literature. Using domain theory we analyse the notion of computability that is substant...
160
click to vote
SOFSEM
2009
Springer
16 years 3 months ago
2009
Springer
This paper considers online compression algorithms that use at most polylogarithmic space (plogon). These algorithms correspond to compressors in the data stream model. We study th...
168
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
Testing whether there is an induced path in a graph spanning k given vertices is already NP-complete in general graphs when k = 3. We show how to solve this problem in polynomial t...
129
Voted
STACS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We consider the problem of representing, in a compressed format, a bitvector S of m bits with n 1s, supporting the following operations, where b ∈ {0, 1}: