Sciweavers

1945 search results - page 44 / 389
» Speeding up Serpent
Sort
View
COLING
2010
14 years 6 months ago
Data-Driven Parsing with Probabilistic Linear Context-Free Rewriting Systems
This paper presents a first efficient implementation of a weighted deductive CYK parser for Probabilistic Linear ContextFree Rewriting Systems (PLCFRS), together with context-summ...
Laura Kallmeyer, Wolfgang Maier
108
Voted
JMLR
2010
149views more  JMLR 2010»
14 years 6 months ago
Fast Committee-Based Structure Learning
Current methods for causal structure learning tend to be computationally intensive or intractable for large datasets. Some recent approaches have speeded up the process by first m...
Ernest Mwebaze, John A. Quinn
TIT
2011
152views more  TIT 2011»
14 years 5 months ago
Fast Exponentiation Using Split Exponents
Abstract—We propose a new method to speed up discrete logarithm (DL)-based cryptosystems by considering a new variant of the DL problem, where the exponents are formed as e1 + α...
Jung Hee Cheon, Stanislaw Jarecki, Taekyoung Kwon,...
CVPR
2011
IEEE
14 years 2 months ago
Adaptive Random Forest - How many ``experts'' to ask before making a decision?
How many people should you ask if you are not sure about your way? We provide an answer to this question for Random Forest classification. The presented method is based on the st...
Alexander Schwing, Christopher Zach, Yefeng Zheng,...
ICASSP
2011
IEEE
14 years 2 months ago
Efficient image reconstruction under sparsity constraints with application to MRI and bioluminescence tomography
Most bioimaging modalities rely on indirect measurements of the quantity under investigation. The image is obtained as the result of an optimization problem involving a physical m...
Matthieu Guerquin-Kern, Jean-Charles Baritaux, Mic...