Sciweavers

3108 search results - page 111 / 622
» The Elements of Computer Credibility
Sort
View
INFORMATICALT
2010
134views more  INFORMATICALT 2010»
15 years 1 months ago
Observability of Turing Machines: A Refinement of the Theory of Computation
The Turing machine is one of the simple abstract computational devices that can be used to investigate the limits of computability. In this paper, they are considered from several ...
Yaroslav D. Sergeyev, Alfredo Garro
JASIS
2010
175views more  JASIS 2010»
14 years 11 months ago
The absence of creativity in Feist and the computational process
The decision of the United States Supreme Court in 1991 in Feist Publications, Inc. v. Rural Tel. Service Co. affirmed originality as a constitutional requirement for copyright. O...
Julian Warner
ICASSP
2011
IEEE
14 years 8 months ago
An efficient rank-deficient computation of the Principle of Relevant Information
One of the main difficulties in computing information theoretic learning (ITL) estimators is the computational complexity that grows quadratically with data. Considerable amount ...
Luis Gonzalo Sánchez Giraldo, José C...
CVPR
2008
IEEE
16 years 6 months ago
Globally optimal bilinear programming for computer vision applications
We present a practical algorithm that provably achieves the global optimum for a class of bilinear programs commonly arising in computer vision applications. Our approach relies o...
Manmohan Krishna Chandraker, David J. Kriegman
PKC
2009
Springer
164views Cryptology» more  PKC 2009»
16 years 5 months ago
Asynchronous Multiparty Computation: Theory and Implementation
Abstract. We propose an asynchronous protocol for general multiparty computation with perfect security and communication complexity O(n2 |C|k) where n is the number of parties, |C|...
Ivan Damgård, Jesper Buus Nielsen, Martin Ge...