1554 search results - page 235 / 311 » Parameterized Complexity and Approximation Algorithms |
120
click to vote
ITC
2003
IEEE
15 years 8 months ago
2003
IEEE
In this paper, we analyze failing circuits and propose a multiple-fault diagnosis approach. Our methodology has been validated experimentally and has proved to be highly efficient...
124
Voted
ICCBR
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. The definition of similarity measures is one of the most crucial aspects when developing case-based applications. In particular, when employing similarity measures that ...
117
Voted
RT
2001
Springer
15 years 7 months ago
2001
Springer
Opacity shadow maps approximate light transmittance inside a complex volume with a set of planar opacity maps. A volume made of standard primitives (points, lines, and polygons) i...
139
Voted
CISS
2007
IEEE
15 years 6 months ago
2007
IEEE
Abstract-Joint subcarrier, power and rate allocation in orthogonal frequency division multiple access (OFDMA) scheduling is investigated for both downlink and uplink wireless trans...
129
Voted
PODS
2010
ACM
15 years 4 months ago
2010
ACM
We study highly expressive query languages such as datalog, fixpoint, and while-languages on probabilistic databases. We generalize these languages such that computation steps (e....