1101 search results - page 213 / 221 » An Algorithm for the Graph Crossing Number Problem |
110
click to vote
WADS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. A Semi-Separated Pair Decomposition (SSPD), with parameter s > 1, of a set S ⊂ Rd is a set {(Ai, Bi)} of pairs of subsets of S such that for each i, there are balls ...
186
click to vote
ICDE
2004
IEEE
15 years 11 months ago
2004
IEEE
Twig queries represent the building blocks of declarative query languages over XML data. A twig query describes a complex traversal of the document graph and generates a set of el...
SSS
2007
Springer
15 years 3 months ago
2007
Springer
We consider Cooperative Intrusion Detection System (CIDS) which is a distributed AIS-based (Artificial Immune System) IDS where nodes collaborate over a peer-to-peer overlay netwo...
SIROCCO
2008
14 years 11 months ago
2008
In the effort to understand the algorithmic limitations of computing by a swarm of robots, the research has focused on the minimal capabilities that allow a problem to be solved. ...
110
click to vote
CORR
2004
Springer
14 years 9 months ago
2004
Springer
In this paper we analyze the relationship between cyclic definitions and consistency in GelfondLifschitz's answer sets semantics (initially defined as `stable model semantics...