Sciweavers

2020 search results - page 66 / 404
» Speeding up Slicing
Sort
View
ENTCS
2007
101views more  ENTCS 2007»
13 years 10 months ago
Compressing Propositional Refutations
We report initial results on shortening propositional resolution refutation proofs. This has an application in speeding up deductive reconstruction (in theorem provers) of large p...
Hasan Amjad
CORR
2004
Springer
76views Education» more  CORR 2004»
13 years 9 months ago
Improved Upper Bound for the Redundancy of Fix-Free Codes
A variable-length code is a fix-free code if no codeword is a prefix or a suffix of any other codeword. In a fix-free code any finite sequence of codewords can be decoded in both d...
Sergey Yekhanin
COLING
2002
13 years 9 months ago
Building a Large-Scale Annotated Chinese Corpus
In this paper we address issues related to building a large-scale Chinese corpus. We try to answer four questions: (i) how to speed up annotation, (ii) how to maintain high annota...
Nianwen Xue, Fu-Dong Chiou, Martha Stone Palmer
IVC
1998
117views more  IVC 1998»
13 years 9 months ago
Stereo inverse perspective mapping: theory and applications
This paper discusses an extension to the inverse perspective mapping geometrical transform to the processing of stereo images and presents the calibration method used on the ARGO ...
Massimo Bertozzi, Alberto Broggi, Alessandra Fasci...
BIRTHDAY
2010
Springer
13 years 5 months ago
Approximate String Matching with Reduced Alphabet
Abstract. We present a method to speed up approximate string matching by mapping the factual alphabet to a smaller alphabet. We apply the alphabet reduction scheme to a tuned versi...
Leena Salmela, Jorma Tarhio