9842 search results - page 1408 / 1969 » The Complexity of the Matching-Cut Problem |
199
click to vote
WDAG
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. We examine the problem of detecting nested temporal predicates given the execution trace of a distributed program. We present a technique that allows efficient detection ...
217
click to vote
3DPVT
2006
IEEE
16 years 1 months ago
2006
IEEE
Interactive network-based navigation over large urban environments raises difficult problems due to the size and complexity of these scenes. In this paper, we present a clientser...
210
click to vote
ACSC
2006
IEEE
16 years 1 months ago
2006
IEEE
Manipulating semistructured data, such as XML, does not t well within conventional programming languages. A typical manipulation requires nding all occurrences of a structure matc...
206
click to vote
ICDM
2006
IEEE
16 years 1 months ago
2006
IEEE
Many information integration tasks require computing similarity between pairs of objects. Pairwise similarity computations are particularly important in record linkage systems, as...
177
click to vote
INFOCOM
2006
IEEE
16 years 1 months ago
2006
IEEE
— We focus on detecting intrusions in ad hoc networks using the misuse detection technique. We allow for detection modules that periodically fail to detect attacks and also gener...