4949 search results - page 229 / 990 » Consistency and Set Intersection |
176
Voted
DAM
2011
15 years 1 months ago
2011
Given a planar graph G, we consider drawings of G in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by an ...
146
click to vote
JSYML
2010
15 years 28 days ago
2010
A set A of vertices of a graph G is called d-scattered in G if no two d-neighborhoods of (distinct) vertices of A intersect. In other words, A is d-scattered if no two distinct ver...
157
click to vote
PODS
2005
ACM
16 years 6 months ago
2005
ACM
We introduce the Multi-Structural Database, a new data framework to support efficient analysis of large, complex data sets. An instance of the model consists of a set of data obje...
158
click to vote
TACAS
2009
Springer
16 years 27 days ago
2009
Springer
CEDAR (Counter Example Driven Antichain Refinement) is a new symbolic algorithm for computing weakest strategies for safety games of imperfect information. The algorithm computes ...
157
click to vote
DASFAA
2010
IEEE
15 years 11 months ago
2010
IEEE
The skyline of a set P of multi-dimensional points (tuples) consists of those points in P for which no clearly better point in P exists, using component-wise comparison on domains ...