Sciweavers

20294 search results - page 108 / 4059
» Algorithmic Information Theory
Sort
View
TCS
2002
15 years 3 months ago
A comparison of two approaches to pseudorandomness
The concept of pseudorandomness plays an important role in cryptography. In this note, we contrast the notions of complexity-theoretic pseudorandom strings (from algorithmic infor...
Yongge Wang
EJIS
2006
108views more  EJIS 2006»
15 years 4 months ago
New frontiers for information systems research: computer art as an information system
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...
Briony J. Oates
VALUETOOLS
2006
ACM
166views Hardware» more  VALUETOOLS 2006»
15 years 10 months ago
Web graph analyzer tool
We present the software tool “Web Graph Analyzer”. This tool is designed to perform a comprehensive analysis of the Web Graph structure. By Web Graph we mean a graph whose ver...
Konstantin Avrachenkov, Danil Nemirovsky, Natalia ...
TIP
2010
111views more  TIP 2010»
14 years 11 months ago
Demosaicking by Alternating Projections: Theory and Fast One-Step Implementation
Color image demosaicking is a key process in the digital imaging pipeline. In this paper, we study a classical demosaicking algorithm based on alternating projections (AP), propos...
Yue M. Lu, Mina Karzand, Martin Vetterli
CADE
2002
Springer
16 years 4 months ago
Formal Verification of a Combination Decision Procedure
Decision procedures for combinations of theories are at the core of many modern theorem provers such as ACL2, Ehdm, PVS, SIMPLIFY, the Stanford Pascal Verifier, STeP, SVC, and Z/Ev...
Jonathan Ford, Natarajan Shankar