1686 search results - page 208 / 338 » Programs as polygraphs: computability and complexity |
140
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
We initiate the study of sublinear-time algorithms in the external memory model [14]. In this model, the data is stored in blocks of a certain size B, and the algorithm is charged...
136
click to vote
INTERNET
2002
15 years 3 months ago
2002
stract level, remote procedure calls enable programmers to invoke (possibly remote) services as if they were intra-application procedure calls. Much like function or procedure call...
151
click to vote
BMCBI
2011
14 years 11 months ago
2011
Background: The interest in non-coding RNAs (ncRNAs) constantly rose during the past few years because of the wide spectrum of biological processes in which they are involved. Thi...
162
click to vote
CGO
2011
IEEE
14 years 8 months ago
2011
IEEE
—Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance ...
169
Voted
JAIR
2011
14 years 7 months ago
2011
There has been significant recent interest in game theoretic approaches to security, with much of the recent research focused on utilizing the leader-follower Stackelberg game mo...