5624 search results - page 248 / 1125 » On Conditional Covering Problem |
144
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In this paper, we show that algorithms on tree decompositions can be made faster with the use of generalisations of fast subset convolution. Amongst others, this gives al...
173
click to vote
CGI
2004
IEEE
15 years 10 months ago
2004
IEEE
Rendering geometric models with complex surface materials in arbitrary lighting environments is a challenging problem. In order to relight and render geometries covered with compl...
174
click to vote
IPM
2006
15 years 6 months ago
2006
This paper presents a probabilistic information retrieval framework in which the retrieval problem is formally treated as a statistical decision problem. In this framework, querie...
187
click to vote
IDEAS
2002
IEEE
15 years 11 months ago
2002
IEEE
Boolean expression simplification is a well-known problem in the history of Computer Science. The problem of determining prime implicates from an arbitrary Boolean expression has...
173
Voted
ISCC
2002
IEEE
15 years 11 months ago
2002
IEEE
—In this paper we consider the problem of routing the lightpaths of a logical topology of a WDM network on an arbitrary physical topology, such that the logical topology remains ...