Sciweavers

4581 search results - page 189 / 917
» Computing Transformation Semigroups
Sort
View
SAMOS
2007
Springer
16 years 19 days ago
Low-Power Twiddle Factor Unit for FFT Computation
An integral part of FFT computation are the twiddle factors, which, in software implementations, are typically stored into RAM memory implying large memory footprint and power cons...
Teemu Pitkänen, Tero Partanen, Jarmo Takala
WOWMOM
2006
ACM
128views Multimedia» more  WOWMOM 2006»
16 years 14 days ago
Enabling Engineering Document in Mobile Computing Environment
A multi-level hierarchical content organization and on-demand delivery framework is presented in this paper. This framework enables engineering content representation and exchange...
Xiaoyong Su, Chi-Cheng Peter Chu, B. S. Prabhu, Ra...
ESA
1998
Springer
175views Algorithms» more  ESA 1998»
15 years 10 months ago
Computing the Edit-Distance between Unrooted Ordered Trees
An ordered tree is a tree in which each node's incident edges are cyclically ordered; think of the tree as being embedded in the plane. Let A and B be two ordered trees. The e...
Philip N. Klein
NMELP
1994
15 years 10 months ago
Computing Stable and Partial Stable Models of Extended Disjunctive Logic Programs
In Prz91], Przymusinski introduced the partial (or 3-valued) stable model semantics which extends the (2-valued) stable model semantics dened originally by Gelfond and Lifschitz G...
Carolina Ruiz, Jack Minker
IPL
2007
78views more  IPL 2007»
15 years 6 months ago
Ensuring the quasi-termination of needed narrowing computations
We present a characterization of first-order functional programs which are quasiterminating w.r.t. the symbolic execution mechanism of needed narrowing, i.e., computations in the...
J. Guadalupe Ramos, Josep Silva, Germán Vid...