1998 search results - page 272 / 400 » Complexity of the Cover Polynomial |
99
Voted
INFOCOM
2006
IEEE
15 years 6 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...
51
Voted
IPPS
2006
IEEE
15 years 6 months ago
2006
IEEE
We study a version of the β-assignment problem [3] on asynchronous rings: consider a set of items and a set of m colors, where each item is associated to one color. Consider also...
90
Voted
CP
2005
Springer
15 years 6 months ago
2005
Springer
QBF is the problem of deciding the satisfiability of quantified boolean formulae in which variables can be either universally or existentially quantified. QBF generalizes SAT (S...
111
Voted
ESA
2005
Springer
15 years 6 months ago
2005
Springer
We study the problem of adding edges to an arbitrary graph so that the resulting graph is an interval graph. Our objective is to add an inclusion minimal set of edges, which means ...
SSD
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Many new applications involving moving objects require the collection and querying of trajectory data, so efficient indexing methods are needed to support complex spatio...