Sciweavers

8949 search results - page 1751 / 1790
» is 1998
Sort
View
EATCS
1998
250views more  EATCS 1998»
14 years 11 months ago
Human Visual Perception and Kolmogorov Complexity: Revisited
Experiments have shown [2] that we can only memorize images up to a certain complexity level, after which, instead of memorizing the image itself, we, sort of, memorize a probabil...
Vladik Kreinovich, Luc Longpré
EC
1998
112views ECommerce» more  EC 1998»
14 years 11 months ago
DNA Computation: Theory, Practice, and Prospects
L. M. Adleman launched the field of DNA computing with a demonstration in 1994 that strands of DNA could be used to solve the Hamiltonian path problem for a simple graph. He also...
Carlo C. Maley
ECCC
1998
105views more  ECCC 1998»
14 years 11 months ago
Pseudorandom generators without the XOR Lemma
Impagliazzo and Wigderson IW97] have recently shown that if there exists a decision problem solvable in time 2O(n) and having circuit complexity 2 (n) (for all but nitely many n) ...
Madhu Sudan, Luca Trevisan, Salil P. Vadhan
ELECTRONICMARKETS
1998
115views more  ELECTRONICMARKETS 1998»
14 years 11 months ago
The Emergence of Linked Fish Markets in Europe
AbstractAbstractAbstractAbstract This paper discusses the development of remote bidding electronic fish auctions. The first electronic fish auctions were introduced in Belgium and ...
Ian Graham
ELECTRONICMARKETS
1998
117views more  ELECTRONICMARKETS 1998»
14 years 11 months ago
Towards Open Electronic Contracting
AbstractAbstractAbstractAbstract A design and pilot implementation of a system, called InterProcs, supporting electronic contracting is presented. A key concept in the design of th...
Ronald M. Lee
« Prev « First page 1751 / 1790 Last » Next »