Sciweavers

3719 search results - page 91 / 744
» order 2010
Sort
View
ECAI
2010
Springer
14 years 10 months ago
Complexity of Axiom Pinpointing in the DL-Lite Family of Description Logics
We investigate the complexity of axiom pinpointing for different members of the DL-Lite family of Description Logics. More precisely, we consider the problem of enumerating all mi...
Rafael Peñaloza, Baris Sertkaya
108
Voted
TSP
2010
14 years 7 months ago
Improved interference cancellation scheme for two-user detection of alamouti code
In this paper, we propose an improved interference cancellation method for two-user multiple access based MIMO communication system. It is shown in the paper, that by using the pr...
Manav R. Bhatnagar, Are Hjørungnes
90
Voted
COMGEO
2010
ACM
14 years 11 months ago
Computing the visibility map of fat objects
Abstract. We give an output-sensitive algorithm for computing the visibility map of a set of n constant-complexity convex fat polyhedra or curved objects in 3-space. Our algorithm ...
Mark de Berg, Chris Gray
ENTCS
2006
94views more  ENTCS 2006»
15 years 21 days ago
Reasoning About Partial Functions in the Formal Development of Programs
Partial functions and operators are used extensively in the formal development of programs and thus development methods have to clarify how to reason about them. There are a numbe...
Cliff B. Jones
53
Voted
ICASSP
2010
IEEE
15 years 27 days ago
Approximate eigenvalue decomposition of para-Hermitian systems through successive FIR paraunitary transformations
The eigenvalue decomposition (EVD) of a Hermitian matrix in terms of unitary matrices is well known. In this paper, we present an algorithm for the approximate EVD (AEVD) of a par...
Andre Tkacenko