9842 search results - page 1404 / 1969 » The Complexity of the Matching-Cut Problem |
161
click to vote
INFOCOM
2008
IEEE
16 years 1 months ago
2008
IEEE
— Consider the situation in which a decision maker (Actor) has to decide which of several available resources to use in the presence of an adversary (called Controller) that can ...
229
click to vote
MEMOCODE
2008
IEEE
16 years 1 months ago
2008
IEEE
Equivalence checking is a classical verification method determining if a finite-state concurrent system (protocol) satisfies its desired external behaviour (service) by compari...
223
click to vote
CRV
2007
IEEE
16 years 1 months ago
2007
IEEE
This paper presents the design and implementation of a multi-resolution graph cuts (MRGC) for stereo-motion framework that produces dense disparity maps. Both stereo and motion ar...
233
click to vote
DASFAA
2007
IEEE
16 years 1 months ago
2007
IEEE
Subspace clustering (also called projected clustering) addresses the problem that different sets of attributes may be relevant for different clusters in high dimensional feature sp...
190
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
— Dealing with RTTs (Round Trip Time) in IQ switches has been recently recognized as a challenging problem, especially if considering distributed (multi-chip) scheduler implement...