Sciweavers

4378 search results - page 47 / 876
» On the Complexity of Ordered Colourings
Sort
View
TSP
2010
13 years 3 months ago
On entropy rate for the complex domain and its application to i.i.d. sampling
We derive the entropy rate formula for a complex Gaussian random process by using a widely linear model. The resulting expression is general and applicable to both circular and non...
Wei Xiong, Hualiang Li, Tülay Adali, Yi-Ou Li...
FSTTCS
2008
Springer
13 years 10 months ago
Analyzing the Implicit Computational Complexity of object-oriented programs
A sup-interpretation is a tool which provides upper bounds on the size of the values computed by the function symbols of a program. Sup-interpretations have shown their interest to...
Jean-Yves Marion, Romain Péchoux
JC
2006
53views more  JC 2006»
13 years 8 months ago
The randomized information complexity of elliptic PDE
We study the information complexity in the randomized setting of solving a general elliptic PDE of order 2m in a smooth, bounded domain Q Rd with smooth coefficients and homogene...
Stefan Heinrich
ECAI
2010
Springer
13 years 6 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
INFOVIS
2000
IEEE
14 years 1 months ago
Creativity, Complexity, and Precision: Information Visualization for (Landscape) Architecture
Drawing on ethnographic studies of (landscape) architects at work, and interdisciplinary cooperation with them, this paper presents a human-centered approach to information visual...
Monika Büscher, Dan Shapiro, Michael Christen...