9842 search results - page 1663 / 1969 » The Complexity of the Matching-Cut Problem |
164
Voted
IWCIA
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
150
click to vote
IWMM
2009
Springer
15 years 11 months ago
2009
Springer
The peak heap consumption of a program is the maximum size of the live data on the heap during the execution of the program, i.e., the minimum amount of heap space needed to run t...
150
click to vote
GLOBECOM
2008
IEEE
15 years 11 months ago
2008
IEEE
Abstract—Consider a communications system where the detector generates a mix of hard and soft outputs, which are then fed into a soft-input channel decoder. In such a setting, it...
135
click to vote
SEMCO
2008
IEEE
15 years 11 months ago
2008
IEEE
Context-aware user interfaces facilitate the user interaction by suggesting or prefilling data derived from the user’s current context. This raises the problem of mapping conte...
154
click to vote
DASFAA
2007
IEEE
15 years 11 months ago
2007
IEEE
Twig pattern matching problem has been widely studied in recent years. Give an XML tree T . A twig-pattern matching query, Q, represented as a query tree, is to find all the occur...