@article {12522,
	title = {Appearance Modeling Using a Geometric Transform},
	journal = {Image Processing, IEEE Transactions on},
	volume = {18},
	year = {2009},
	month = {2009/04//},
	pages = {889 - 902},
	abstract = {A general transform, called the geometric transform (GeT), that models the appearance inside a closed contour is proposed. The proposed GeT is a functional of an image intensity function and a region indicator function derived from a closed contour. It can be designed to combine the shape and appearance information at different resolutions and to generate models invariant to deformation, articulation, or occlusion. By choosing appropriate functionals and region indicator functions, the GeT unifies Radon transform, trace transform, and a class of image warpings. By varying the region indicator and the types of features used for appearance modeling, five novel types of GeTs are introduced and applied to fingerprinting the appearance inside a contour. They include the GeTs based on a level set, shape matching, feature curves, and the GeT invariant to occlusion, and a multiresolution GeT (MRGeT). Applications of GeT to pedestrian identity recognition, human body part segmentation, and image synthesis are illustrated. The proposed approach produces promising results when applied to fingerprinting the appearance of a human and body parts despite the presence of nonrigid deformations and articulated motion.},
	keywords = {body, contour;feature, curve;fingerprinting;geometric, function;image, function;shape, geometry;image, identity, indicator, INTENSITY, matching;trace, method;pedestrian, modeling;closed, part, Radon, recognition;region, resolution;image, segmentation;, segmentation;image, set, synthesis;image, transform;appearance, transform;human, transform;Radon, transforms;computational, warping;level},
	isbn = {1057-7149},
	doi = {10.1109/TIP.2008.2011381},
	author = {Li,Jian and Zhou,S. K and Chellapa, Rama}
}
@conference {12289,
	title = {Trust-preserving set operations},
	booktitle = {INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies},
	volume = {4},
	year = {2004},
	month = {2004/03//},
	pages = {2231 - 2241 vol.4 - 2231 - 2241 vol.4},
	abstract = {We describe a method for performing trust-preserving set operations by untrusted parties. Our motivation for this is the problem of securely reusing content-based search results in peer-to-peer networks. We model search results and indexes as data sets. Such sets have value for answering a new query only if they are trusted. In the absence of any system-wide security mechanism, a data set is trusted by a node a only if it was generated by some node which is trusted by a. Our main contributions are a formal definition of the problem as well as an efficient scheme that solves this problem by allowing untrusted peers to perform set operations on trusted data sets while also producing unforgeable proofs of correctness. This is accomplished by requiring trusted nodes to sign appropriately-defined digests of generated sets; each such digest consists of an RSA accumulator and a Bloom filter. The scheme is general, and has other applications as well. We give an analysis demonstrating the low overhead of the scheme, and we include experimental data which confirm the analysis.},
	keywords = {accumulator;, Bloom, computing;, filter;, mechanism;, network;, operation;, peer-to-peer, RSA, Security, security;, set, system-wide, Telecommunication, theory;, trust-preserving},
	doi = {10.1109/INFCOM.2004.1354646},
	author = {Morselli,R. and Bhattacharjee, Bobby and Katz, Jonathan and Keleher,P.}
}
@conference {15018,
	title = {Prefix computations on symmetric multiprocessors},
	booktitle = {Parallel and Distributed Processing, 1999. 13th International and 10th Symposium on Parallel and Distributed Processing, 1999. 1999 IPPS/SPDP. Proceedings},
	year = {1999},
	month = {1999/04//},
	pages = {7 - 13},
	abstract = {We introduce a new optimal prefix computation algorithm on linked lists which builds upon the sparse ruling set approach of Reid-Miller and Blelloch. Besides being somewhat simpler and requiring nearly half the number of memory accesses, we can bound our complexity with high probability instead of merely on average. Moreover, whereas Reid-Miller and Blelloch (1996) targeted their algorithm for implementation on a vector multiprocessor architecture, we develop our algorithm for implementation on the symmetric multiprocessor architecture (SMP). These symmetric multiprocessors dominate the high-end server market and are currently the primary candidate for constructing large scale multiprocessor systems. Our prefix computation algorithm was implemented in C using POSIX threads and run on four symmetric multiprocessors-the IBM SP-2 (High Node), the HP-Convex Exemplar (S-Class), the DEC AlphaServer; and the Silicon Graphics Power Challenge. We ran our code using a variety of benchmarks which we identified to examine the dependence of our algorithm on memory access patterns. For some problems, our algorithm actually matched or exceeded the performance of the standard sequential solution using only a single thread. Moreover, in spite of the fact that the processors must compete for access to main memory, our algorithm still achieved scalable performance with up to 16 processors, which was the largest platform available to us},
	keywords = {access, algorithms;, AlphaServer;HP-Convex, approach;symmetric, architecture;symmetric, Challenge;high-end, computations;scalable, DEC, Exemplar;IBM, Graphics, market;large, multiprocessor, multiprocessors;Unix;distributed, patterns;prefix, performance;sparse, power, ruling, scale, server, set, SP-2;POSIX, systems;memory, threads;Silicon},
	doi = {10.1109/IPPS.1999.760427},
	author = {Helman,D.R. and JaJa, Joseph F.}
}
