Sciweavers

3281 search results - page 120 / 657
» Bases for parametrized iterativity
Sort
View
134
Voted
ENTCS
2002
91views more  ENTCS 2002»
15 years 1 months ago
Memoization-Based Proof Search in LF - an Experimental Evaluation of a Prototype
Elf is a general meta-language for the specification and implementation of logical systems in the style of the logical framework LF. Proof search in this framework is based on the...
Brigitte Pientka
AMAST
2004
Springer
15 years 7 months ago
Separate Compositional Analysis of Class-Based Object-Oriented Languages
Abstract. We present a separate compositional analysis for objectoriented languages. We show how a generic static analysis of a context that uses an object can be split into two se...
Francesco Logozzo
TCSV
2002
93views more  TCSV 2002»
15 years 1 months ago
The performance of H263-based video telephony over turbo-equalized GSM/GPRS
The performance of turbo-equalized Global System of Mobile Communications/General Packet Radio Service (GSM/GPRS)-like videophone transceivers is studied over dispersive fading cha...
Peter J. Cherriman, Bee Leong Yeap, Lajos Hanzo
JAIR
2010
130views more  JAIR 2010»
15 years 5 days ago
Join-Graph Propagation Algorithms
The paper investigates parameterized approximate message-passing schemes that are based on bounded inference and are inspired by Pearl’s belief propagation algorithm (BP). We st...
Robert Mateescu, Kalev Kask, Vibhav Gogate, Rina D...
NA
2010
118views more  NA 2010»
15 years 4 days ago
Practical Quasi-Newton algorithms for singular nonlinear systems
Quasi-Newton methods for solving singular systems of nonlinear equations are considered in this paper. Singular roots cause a number of problems in implementation of iterative met...
Sandra Buhmiler, Natasa Krejic, Zorana Luzanin