18090 search results - page 3301 / 3618 » Computing by Only Observing |
197
click to vote
STACS
2005
Springer
16 years 3 days ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
170
click to vote
TLCA
2005
Springer
16 years 3 days ago
2005
Springer
There is growing public concern about personal data collected by both private and public sectors. People have very little control over what kinds of data are stored and how such da...
157
click to vote
ACMSE
2004
ACM
16 years 2 days ago
2004
ACM
In this paper, we propose a routing protocol that is based on securing the routing information from unauthorized users. Even though routing protocols of this category are already ...
188
click to vote
CASES
2004
ACM
16 years 2 days ago
2004
ACM
A coarse-grain multithreaded processor can effectively hide long memory latencies by quickly switching to an alternate task when the active task issues a memory request, improving...
168
click to vote
JCDL
2004
ACM
16 years 2 days ago
2004
ACM
Today people typically read and annotate printed documents even if they are obtained from electronic sources like digital libraries. If there is a reason for them to share these p...