8437 search results - page 550 / 1688 » Preferences over Sets |
184
click to vote
TOCL
2011
15 years 2 months ago
2011
In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the s...
282
click to vote
PODC
2011
ACM
14 years 10 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
222
click to vote
CVPR
2012
IEEE
13 years 9 months ago
2012
IEEE
The projections of world parallel lines in an image intersect at a single point called the vanishing point (VP). VPs are a key ingredient for various vision tasks including rotati...
191
click to vote
TVCG
2012
13 years 9 months ago
2012
—In this paper, we introduce a new approach to computing a Morse decomposition of a vector field on a triangulated manifold surface. The basic idea is to convert the input vector...
332
click to vote
ICDE
2004
IEEE
16 years 8 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...