Sciweavers

11051 search results - page 55 / 2211
» An Investigation of Generalized Cases
Sort
View
FROCOS
2007
Springer
14 years 4 months ago
Noetherianity and Combination Problems
In abstract algebra, a structure is said to be Noetherian if it does not admit infinite strictly ascending chains of congruences. In this paper, we adapt this notion to first-ord...
Silvio Ghilardi, Enrica Nicolini, Silvio Ranise, D...
CALCO
2009
Springer
115views Mathematics» more  CALCO 2009»
14 years 4 months ago
Relating Coalgebraic Notions of Bisimulation
d abstract) Sam Staton Computer Laboratory, University of Cambridge Abstract. A labelled transition system can be understood as a coalgebra for a particular endofunctor on the cate...
Sam Staton
CORR
2006
Springer
151views Education» more  CORR 2006»
13 years 10 months ago
A general computation rule for lossy summaries/messages with examples from equalization
Abstract-- Elaborating on prior work by Minka, we formulate a general computation rule for lossy messages. An important special case (with many applications in communications) is t...
Junli Hu, Hans-Andrea Loeliger, Justin Dauwels, Fr...
CDC
2008
IEEE
141views Control Systems» more  CDC 2008»
14 years 4 months ago
Generalized linear dynamic factor models - a structure theory
— In this paper we present a structure theory for generalized linear dynamic factor models (GDFM’s). Emphasis is laid on the so-called zeroless case. GDFM’s provide a way of ...
Brian D. O. Anderson, Manfred Deistler
CORR
2007
Springer
93views Education» more  CORR 2007»
13 years 10 months ago
Dualheap Sort Algorithm: An Inherently Parallel Generalization of Heapsort
A generalization of the heapsort algorithm is proposed. At the expense of about 50% more comparison and move operations for typical cases, the dualheap sort algorithm offers sever...
Greg Sepesi