Sciweavers

13987 search results - page 353 / 2798
» The Two Guards Problem
Sort
View
ESANN
2006
15 years 8 months ago
A simple idea to separate convolutive mixtures in an undetermined scenario
We consider a blind separation problem for undetermined mixtures of two BPSK signals in a multi-path fading channel. We use independence and frequency diversity of the two source s...
Maciej Pedzisz, Ali Mansour
ANLP
1994
72views more  ANLP 1994»
15 years 8 months ago
Tagging accurately - Don't guess if you know
We discuss combining knowledge-based (or rule-based) and statistical part-of-speech taggers. We use two mature taggers, ENGCG and Xerox Tagger, to independently tag the same text ...
Pasi Tapanainen, Atro Voutilainen
COMBINATORICS
2006
98views more  COMBINATORICS 2006»
15 years 6 months ago
Shift Equivalence of P-finite Sequences
We present an algorithm which decides the shift equivalence problem for Pfinite sequences. A sequence is called P-finite if it satisfies a homogeneous linear recurrence equation w...
Manuel Kauers
DAM
2006
79views more  DAM 2006»
15 years 6 months ago
A simple expected running time analysis for randomized "divide and conquer" algorithms
There are many randomized "divide and conquer" algorithms, such as randomized Quicksort, whose operation involves partitioning a problem of size n uniformly at random int...
Brian C. Dean
IJNSEC
2007
89views more  IJNSEC 2007»
15 years 6 months ago
Vulnerabilities in the Adachi-Aoki-Komano-Ohta Micropayment Scheme
Rivest and Shamir presented two simple micropayment schemes, “PayWord” and “MicroMint,” for making small purchases over the Internet [14]. Recently, Adachi et al. have poi...
Minho Kim, Çetin Kaya Koç