Sciweavers

18090 search results - page 353 / 3618
» Computing by Only Observing
Sort
View
CRYPTO
2000
Springer
110views Cryptology» more  CRYPTO 2000»
15 years 11 months ago
Parallel Reducibility for Information-Theoretically Secure Computation
Secure Function Evaluation (SFE) protocols are very hard to design, and reducibility has been recognized as a highly desirable property of SFE protocols. Informally speaking, reduc...
Yevgeniy Dodis, Silvio Micali
MICRO
2008
IEEE
93views Hardware» more  MICRO 2008»
15 years 6 months ago
What Kinds of Computer-Software-Related Advances (if Any) Are Eligible for Patents? Part II: The "Useful Arts" Requirement
of nature, or abstract idea (collectively, a principle). The clue to the patent-eligibility of processes that do not involve substance-transformation is whether the process impleme...
Richard Stern
CORR
2010
Springer
82views Education» more  CORR 2010»
15 years 4 months ago
Computing (or not) Quasi-Periodicity Functions of Tilings
Abstract. We know that tilesets that can tile the plane always admit a quasiperiodic tiling [4, 8], yet they hold many uncomputable properties [3, 11, 21, 25]. The quasi-periodicit...
Alexis Ballier, Emmanuel Jeandel
174
Voted
BMCBI
2007
162views more  BMCBI 2007»
15 years 6 months ago
Genome-wide identification of specific oligonucleotides using artificial neural network and computational genomic analysis
Background: Genome-wide identification of specific oligonucleotides (oligos) is a computationallyintensive task and is a requirement for designing microarray probes, primers, and ...
Chun-Chi Liu, Chin-Chung Lin, Ker-Chau Li, Wen-Shy...
COMBINATORICS
1999
75views more  COMBINATORICS 1999»
15 years 6 months ago
Stability of Kronecker Products of Irreducible Characters of the Symmetric Group
F. Murnaghan observed a long time ago that the computation of the decompositon of the Kronecker product (n-a,2,... ) (n-b,
Ernesto Vallejo