Sciweavers

7380 search results - page 1357 / 1476
» time 2008
Sort
View
DAM
1999
100views more  DAM 1999»
15 years 4 months ago
Complexity Analysis of Propositional Resolution with Autarky Pruning
An algorithm called Modoc", which has been introduced elsewhere, enhances propositional model elimination with autarky pruning, and other features. The model elimination meth...
Allen Van Gelder
DAM
1999
114views more  DAM 1999»
15 years 4 months ago
Perfect and Almost Perfect Sequences
The autocorrelation function of a sequence is a measure for how much the given sequence di ers from its translates. Periodic binary sequences with good correlation properties have...
Dieter Jungnickel, Alexander Pott
SCP
1998
163views more  SCP 1998»
15 years 4 months ago
Computing with Continuous Change
A central challenge in computer science and knowledge representation is the integration of conceptual frameworks for continuous and discrete change, as exemplified by the theory ...
Vineet Gupta, Radha Jagadeesan, Vijay A. Saraswat
SIAMCOMP
1998
117views more  SIAMCOMP 1998»
15 years 4 months ago
The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel Algorithms
This paper introduces the queue-read, queue-write (qrqw) parallel random access machine (pram) model, which permits concurrent reading and writing to shared memory locations, but ...
Phillip B. Gibbons, Yossi Matias, Vijaya Ramachand...
SPEECH
1998
69views more  SPEECH 1998»
15 years 4 months ago
Noisy speech enhancement using discrete cosine transform
This paper illustrates the advantages of using the Discrete Cosine Transform (DCT) as compared to the standard Discrete Fourier Transform (DFT) for the purpose of removing noise e...
Ing Yann Soon, Soo Ngee Koh, Chai Kiat Yeo
« Prev « First page 1357 / 1476 Last » Next »