4378 search results - page 47 / 876 » On the Complexity of Ordered Colourings |
152
click to vote
TSP
2010
15 years 25 days ago
2010
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...
142
click to vote
FSTTCS
2008
Springer
15 years 7 months ago
2008
Springer
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...
133
click to vote
JC
2006
15 years 6 months ago
2006
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...
160
click to vote
ECAI
2010
Springer
15 years 4 months ago
2010
Springer
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...
137
click to vote
INFOVIS
2000
IEEE
15 years 10 months ago
2000
IEEE
Drawing on ethnographic studies of (landscape) architects at work, and interdisciplinary cooperation with them, this paper presents a human-centered approach to information visual...