7123 search results - page 98 / 1425 » The Ordered Set of Rough Sets |
SCIA
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. Level set methods are a popular way to solve the image segmentation problem in computer image analysis. A contour is implicitly represented by the zero level of a signed ...
ACSAC
2006
IEEE
14 years 4 months ago
2006
IEEE
Instruction Set Randomization (ISR) has been proposed as a form of defense against binary code injection into an executing program. One proof-of-concept implementation is Randomiz...
CRYPTO
2005
Springer
14 years 3 months ago
2005
Springer
In many important applications, a collection of mutually distrustful parties must perform private computation over multisets. Each party’s input to the function is his private i...
SPAA
1998
ACM
14 years 2 months ago
1998
ACM
We present parallel algorithms for union, intersection and difference on ordered sets using random balanced binary trees (treaps [26]). For two sets of size n and m (m ≤ n) the...
DCOSS
2008
Springer
13 years 12 months ago
2008
Springer
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...