Sciweavers

218 search results - page 36 / 44
» Composite Binary Losses
Sort
View
POPL
2010
ACM
14 years 4 months ago
Semantics and Algorithms for Data-dependent Grammars
Traditional parser generation technologies are incapable of handling the demands of modern programmers. In this paper, we present the design and theory of a new parsing engine, YA...
Yitzhak Mandelbaum, Trevor Jim, David Walker
HICSS
2002
IEEE
191views Biometrics» more  HICSS 2002»
14 years 10 days ago
Mindmap: Utilizing Multiple Taxonomies and Visualization to Understand a Document Collection
We present a novel system and methodology for browsing and exploring topics and concepts within a document collection. The process begins with the generation of multiple taxonomie...
W. Scott Spangler, Jeffrey T. Kreulen, Justin Less...
BMCBI
2006
92views more  BMCBI 2006»
13 years 7 months ago
Demonstration of two novel methods for predicting functional siRNA efficiency
Background: siRNAs are small RNAs that serve as sequence determinants during the gene silencing process called RNA interference (RNAi). It is well know that siRNA efficiency is cr...
Peilin Jia, Tieliu Shi, Yu-Dong Cai, Yixue Li
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
14 years 7 months ago
The PCP theorem by gap amplification
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
Irit Dinur
PLANX
2008
13 years 8 months ago
XML Type Checking for Macro Tree Transducers with Holes
Macro forest transducers (mfts) extend macro tree transducers (mtts) from ranked to unranked trees. Mfts are more powerful than mtts (operating on binary tree encodings) because t...
Sebastian Maneth, Keisuke Nakano