Sciweavers

570 search results - page 61 / 114
» On the number of zero-sum subsequences
Sort
View
FCCM
1999
IEEE
122views VLSI» more  FCCM 1999»
14 years 2 months ago
Safe and Protected Execution for the Morph/AMRM Reconfigurable Processor
Technology scaling of CMOS processes brings relatively faster transistors (gates) and slower interconnects (wires), making viable the addition of reconfigurability to increase per...
Andrew A. Chien, Jay H. Byun
IPPS
1999
IEEE
14 years 2 months ago
Parallel Biological Sequence Comparison Using Prefix Computations
We present practical parallel algorithms using prefix computations for various problems that arise in pairwise comparison of biological sequences. We consider both constant and af...
Srinivas Aluru, Natsuhiko Futamura, Kishan Mehrotr...
GW
1999
Springer
134views Biometrics» more  GW 1999»
14 years 2 months ago
Toward Scalability in ASL Recognition: Breaking Down Signs into Phonemes
In this paper we present a novel approach to continuous, whole-sentence ASL recognition that uses phonemes instead of whole signs as the basic units. Our approach is based on a se...
Christian Vogler, Dimitris N. Metaxas
ICCL
1998
IEEE
14 years 2 months ago
Controlled Self-Applicable On-Line Partial Evaluation, Using Strategies
On-line partial evaluators are hardly ever selfapplicable, because the complexity of deciding whether to residualize terms causes combinatorial explosion when self-application is ...
M. Beckman, Samuel N. Kamin
KBSE
1997
IEEE
14 years 2 months ago
NORA/HAMMR: Making Deduction-Based Software Component Retrieval Practical
Deduction-based software component retrieval uses preand postconditions as indexes and search keys and an automated theorem prover (ATP) to check whether a component matches. This...
Johann Schumann, Bernd Fischer 0002