Sciweavers

3378 search results - page 135 / 676
» A universe of binding and computation
Sort
View
RTA
2010
Springer
14 years 8 months ago
The Undecidability of Type Related Problems in Type-free Style System F
We consider here a number of variations on the System F, that are predicative second-order systems whose terms are intermediate between the Curry style and Church style. The terms ...
Ken-etsu Fujita, Aleksy Schubert
ACL
2009
14 years 7 months ago
A Unified Single Scan Algorithm for Japanese Base Phrase Chunking and Dependency Parsing
We describe an algorithm for Japanese analysis that does both base phrase chunking and dependency parsing simultaneously in linear-time with a single scan of a sentence. In this p...
Manabu Sassano, Sadao Kurohashi
BMCBI
2010
119views more  BMCBI 2010»
14 years 10 months ago
Multi-task learning for cross-platform siRNA efficacy prediction: an in-silico study
Background: Gene silencing using exogenous small interfering RNAs (siRNAs) is now a widespread molecular tool for gene functional study and new-drug target identification. The key...
Qi Liu, Qian Xu, Vincent Wenchen Zheng, Hong Xue, ...
EC
1998
112views ECommerce» more  EC 1998»
14 years 9 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
STOC
1997
ACM
122views Algorithms» more  STOC 1997»
15 years 2 months ago
Fault-Tolerant Quantum Computation With Constant Error
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
Dorit Aharonov, Michael Ben-Or