9842 search results - page 1347 / 1969 » The Complexity of the Matching-Cut Problem |
194
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
We study the problem of computing zigzag persistence of a sequence of homology groups and study a particular sequence derived from the levelsets of a real-valued function on a top...
192
click to vote
ICC
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract— Achieving minimal loss while satisfying an acceptable delay profile remains to be an open problem under the RED queuing discipline. In this paper, we present a framewo...
143
Voted
ICDM
2008
IEEE
16 years 1 months ago
2008
IEEE
The task of aligning sequences arises in many applications. Classical dynamic programming approaches require the explicit state enumeration in the reward model. This is often impr...
205
Voted
ICRA
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract— Teams of mobile robots have been recently proposed as effective means of completing complex missions involving multiple tasks spatially distributed over a large area. A...
187
click to vote
IEEEARES
2008
IEEE
16 years 1 months ago
2008
IEEE
Existing undecidability proofs of checking secrecy of cryptographic protocols have the limitations of not considering protocols common in literature, which are in the form of comm...