Sciweavers

503 search results - page 2 / 101
» Equality In Lazy Computation Systems
Sort
View
PLILP
1993
Springer
13 years 11 months ago
A Demand Driven Computation Strategy for Lazy Narrowing
Many recent proposals for the integration of functional and logic programming use conditional term rewriting systems (CTRS) as programs and narrowing as goal solving mechanism. Thi...
Rita Loogen, Francisco Javier López-Fraguas...
ICASSP
2008
IEEE
14 years 1 months ago
Computationally efficient equalization of room impulse responses robust to system estimation errors
Equalization techniques for room impulse responses (RIRs) are important in acoustic signal processing applications such as speech dereverberation. In practice, only approximate es...
Wancheng Zhang, Nikolay D. Gaubitch, Patrick A. Na...
DLOG
2001
13 years 8 months ago
Using Lazy Unfolding for the Computation of Least Common Subsumers
For description logics with existential restrictions, the size of the least common subsumer (lcs) of concept descriptions may grow exponentially in the size of the concept descrip...
Anni-Yasmin Turhan, Ralf Molitor
JUCS
2007
122views more  JUCS 2007»
13 years 7 months ago
A New Architecture for Concurrent Lazy Cyclic Reference Counting on Multi-Processor Systems
: Multi-processor systems have become the standard in current computer architectures. Software developers have the possibility to take advantage of the additional computing power a...
Andrei de Araújo Formiga, Rafael Dueire Lin...
IGPL
2007
107views more  IGPL 2007»
13 years 7 months ago
Equal Rights for the Cut: Computable Non-analytic Cuts in Cut-based Proofs
This work studies the structure of proofs containing non-analytic cuts in the cut-based system, a sequent inference system in which the cut rule is not eliminable and the only bra...
Marcelo Finger, Dov M. Gabbay