Sciweavers

7289 search results - page 84 / 1458
» A Dependent Set Theory
Sort
View
ENTCS
2006
162views more  ENTCS 2006»
13 years 8 months ago
Continuous Functions on Final Coalgebras
It can be traced back to Brouwer that continuous functions of type StrA B, where StrA is the type of infinite streams over elements of A, can be represented by well founded, Abra...
Neil Ghani, Peter Hancock, Dirk Pattinson
TSP
2008
114views more  TSP 2008»
13 years 7 months ago
Zero-Forcing Precoding and Generalized Inverses
Abstract--We consider the problem of linear zero-forcing precoding design and discuss its relation to the theory of generalized inverses in linear algebra. Special attention is giv...
Ami Wiesel, Yonina C. Eldar, Shlomo Shamai
AI
2000
Springer
13 years 7 months ago
Boolean connection algebras: A new approach to the Region-Connection Calculus
The Region-Connection Calculus (RCC) is a well established formal system for qualitative spatial reasoning. It provides an axiomatization of space which takes regions as primitive...
John G. Stell
ICASSP
2011
IEEE
12 years 11 months ago
An utterance comparison model for speaker clustering using factor analysis
We propose a novel utterance comparison model based on probability theory and factor analysis that computes the likelihood of two speech utterances originating from the same speak...
Woojay Jeon, Changxue Ma, Dusan Macho
SIAMCOMP
1998
114views more  SIAMCOMP 1998»
13 years 7 months ago
Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
Stefan Felsner, Lorenz Wernisch