70 search results - page 3 / 14 » Binary (generalized) Post Correspondence Problem |
CCS
2008
ACM
14 years 11 months ago
2008
ACM
In this paper, we model Probabilistic Packet Marking (PPM) schemes for IP traceback as an identification problem of a large number of markers. Each potential marker is associated ...
108
click to vote
CPAIOR
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. In recent work binary decision diagrams (BDDs) were introduced as a technique for postoptimality analysis for integer programming. In this paper we show that much smaller...
DCOSS
2008
Springer
14 years 11 months ago
2008
Springer
This paper studies the problem of associating deterministically a track revealed by a binary sensor network with the trajectory of a unique moving anonymous object, namely the Mult...
78
Voted
SIAMCOMP
2000
14 years 9 months ago
2000
Abstract. We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and parti...
CP
2001
Springer
15 years 1 months ago
2001
Springer
Non-binary constraint satisfaction problems (CSPs) can be solved in two different ways. We can either translate the problem into an equivalent binary one and solve it using well-e...