5344 search results - page 133 / 1069 » Privacy-Preserving Set Operations |
117
Voted
CPAIOR
2008
Springer
15 years 4 months ago
2008
Springer
A domino portrait is an approximation of an image using a given number of sets of dominoes. This problem was first stated in
152
Voted
ORL
2011
14 years 5 months ago
2011
Anderson, Cornu´ejols and Li (2005) show that for a polyhedral mixed integer set defined by a constraint system
106
Voted
ICALP
2005
Springer
15 years 8 months ago
2005
Springer
A union-find data structure maintains a collection of disjoint sets under makeset, union and find operations. Kaplan, Shafrir and Tarjan [SODA 2002] designed data structures for ...
129
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
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 se...
133
Voted
TOCL
2011
14 years 9 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...