@conference {13978,
	title = {Canny edge detection on NVIDIA CUDA},
	booktitle = {Computer Vision and Pattern Recognition Workshops, 2008. CVPRW {\textquoteright}08. IEEE Computer Society Conference on},
	year = {2008},
	month = {2008/06//},
	pages = {1 - 8},
	abstract = {The Canny edge detector is a very popular and effective edge feature detector that is used as a pre-processing step in many computer vision algorithms. It is a multi-step detector which performs smoothing and filtering, non-maxima suppression, followed by a connected-component analysis stage to detect ldquotruerdquo edges, while suppressing ldquofalserdquo non edge filter responses. While there have been previous (partial) implementations of the Canny and other edge detectors on GPUs, they have been focussed on the old style GPGPU computing with programming using graphical application layers. Using the more programmer friendly CUDA framework, we are able to implement the entire Canny algorithm. Details are presented along with a comparison with CPU implementations. We also integrate our detector in to MATLAB, a popular interactive simulation package often used by researchers. The source code will be made available as open source.},
	keywords = {algorithms;connected-component, analysis, application, Canny, CUDA;computer, detection;feature, detection;NVIDIA, detector;filtering;graphical, detector;non, edge, extraction;smoothing, feature, filter, layers;multistep, methods;, responses;nonmaxima, stage;edge, suppression;smoothing;computer, VISION, vision;edge},
	doi = {10.1109/CVPRW.2008.4563088},
	author = {Luo,Yuancheng and Duraiswami, Ramani}
}
@conference {12306,
	title = {Scalable peer finding on the Internet},
	booktitle = {Global Telecommunications Conference, 2002. GLOBECOM {\textquoteright}02. IEEE},
	volume = {3},
	year = {2002},
	month = {2002/11//},
	pages = {2205 - 2209 vol.3 - 2205 - 2209 vol.3},
	abstract = {We consider the problem of finding nearby application peers over the Internet. We define a new peer-finding scheme (called Tiers) that scales to large application peer groups. Tiers creates a hierarchy of the peers, which allows an efficient and scalable solution to this problem. The scheme can be implemented entirely in the application-layer and does not require the deployment of either any additional measurement services, or well-known reference landmarks in the network. We present detailed evaluation of Tiers and compare it to one previously proposed scheme called Beaconing. Through analysis and detailed simulations on 10,000 node Internet-like topologies we show that Tiers achieves comparable or better performance with a significant reduction in control overheads for groups of size 32 or more.},
	keywords = {application, application-layer;, Beaconing;, CONTROL, finding;, Internet-like, Internet;, measurement, network, overhead, peer, peer-finding, peers;, protocol;, protocols;, reduction;, scalable, scheme;, services;, simulations;, solution;, Tiers;, topologies;, topology;},
	doi = {10.1109/GLOCOM.2002.1189023},
	author = {Banerjee,S. and Kommareddy,C. and Bhattacharjee, Bobby}
}
