8699 search results - page 304 / 1740 » Elements of the Theory of Computation |
204
click to vote
ISAAC
2007
Springer
16 years 26 days ago
2007
Springer
In an uncertain data set S = (S, p, f) where S is the ground set consisting of n elements, p : S → [0, 1] a probability function, and f : S → R a score function, each element i...
207
click to vote
IPPS
2006
IEEE
16 years 23 days ago
2006
IEEE
In this paper we study the performance improvements and trade-offs derived from an optimized mapping approach applied on a parametric coarse grained reconfigurable array architect...
259
click to vote
DC
2008
15 years 6 months ago
2008
We study the problem of maintaining a sketch of recent elements of a data stream. Motivated by applications involving network data, we consider streams that are asynchronous, in wh...
226
click to vote
LOGCOM
2010
15 years 1 months ago
2010
We describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictor...
162
click to vote
EJIS
2006
15 years 6 months ago
2006
This paper proposes extending the frontiers of information systems (IS) research by seeing computer art as a kind of information system. It explores some research questions that a...