Sciweavers

6568 search results - page 383 / 1314
» Reducing the Complexity of Reductions
Sort
View
TVLSI
2002
134views more  TVLSI 2002»
15 years 7 months ago
Theoretical analysis of bus-invert coding
Theoretical analysis of bus-invert coding for reducing switching activity was previously investigated. In this paper we conduct a theoretical analysis of this method for coupling r...
Rung-Bin Lin, Chi-Ming Tsai
MICS
2007
68views more  MICS 2007»
15 years 7 months ago
Space Saving Calculation of Symbolic Resultants
We describe an approach to the computation of symbolic resultants in which factors are removed during the course of the calculation, so reducing the stack size required for interme...
Jane M. Pearson, Noel G. Lloyd
ACL
2010
15 years 5 months ago
Simple Semi-Supervised Training of Part-Of-Speech Taggers
Most attempts to train part-of-speech taggers on a mixture of labeled and unlabeled data have failed. In this work stacked learning is used to reduce tagging to a classification t...
Anders Søgaard
EMNLP
2009
15 years 5 months ago
Fully Lexicalising CCGbank with Hat Categories
We introduce an extension to CCG that allows form and function to be represented simultaneously, reducing the proliferation of modifier categories seen in standard CCG analyses. W...
Matthew Honnibal, James R. Curran
ICASSP
2011
IEEE
14 years 11 months ago
cROVER: Improving ROVER using automatic error detection
Recognizer Output Voting Error Reduction (ROVER), is a well-known procedure for decoders’ combination aiming at reducing the Word Error Rate (WER) in transcription applications....
Kacem Abida, Fakhri Karray, Wafa Abida