Sciweavers

6568 search results - page 364 / 1314
» Reducing the Complexity of Reductions
Sort
View
SEBD
2007
121views Database» more  SEBD 2007»
15 years 9 months ago
Query Answering in Expressive Variants of DL-Lite
The use of ontologies in various application domains, such as Data Integration, the Semantic Web, or ontology-based data management, where ontologies provide the access to large am...
Alessandro Artale, Diego Calvanese, Roman Kontchak...
STOC
2005
ACM
145views Algorithms» more  STOC 2005»
16 years 8 months ago
On uniform amplification of hardness in NP
We continue the study of amplification of average-case complexity within NP, and we focus on the uniform case. We prove that if every problem in NP admits an efficient uniform alg...
Luca Trevisan
ISCAS
2008
IEEE
136views Hardware» more  ISCAS 2008»
16 years 2 months ago
VLSI architecture for data-reduced steering matrix feedback in MIMO systems
Abstract— Beamforming (BF) for multiple-input multipleoutput (MIMO) wireless communications systems can improve the error rate performance by spatial separation of the transmitte...
Christoph Studer, Peter Luethi, Wolfgang Fichtner
DATE
2007
IEEE
92views Hardware» more  DATE 2007»
16 years 1 months ago
Random sampling of moment graph: a stochastic Krylov-reduction algorithm
In this paper we introduce a new algorithm for model order reduction in the presence of parameter or process variation. Our analysis is performed using a graph interpretation of t...
Zhenhai Zhu, Joel R. Phillips
CALCO
2005
Springer
114views Mathematics» more  CALCO 2005»
16 years 1 months ago
Towards a Coalgebraic Semantics of the Ambient Calculus
Recently, various process calculi have been introduced which are suited for the modelling of mobile computation and in particular the mobility of program code; a prominent example ...
Daniel Hausmann, Till Mossakowski, Lutz Schrö...