680 search results - page 97 / 136 » A randomized embedding algorithm for trees |
SPAA
1998
ACM
14 years 1 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...
ICDM
2006
IEEE
14 years 2 months ago
2006
IEEE
Shape clustering can significantly facilitate the automatic labeling of objects present in image collections. For example, it could outline the existing groups of pathological ce...
CHES
2009
Springer
14 years 9 months ago
2009
Springer
Fault attacks exploit hardware malfunctions to recover secrets from embedded electronic devices. In the late 90's, Boneh, DeMillo and Lipton [6] introduced fault-based attacks...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
DOCENG
2005
ACM
13 years 10 months ago
2005
ACM
Document representations can rapidly become unwieldy if they try to encapsulate all possible document properties, ranging tract structure to detailed rendering and layout. We pres...