Sciweavers

199 search results - page 24 / 40
» Fast Algorithms for Computing Tree LCS
Sort
View
ISBI
2004
IEEE
16 years 13 days ago
Fast Multiresolution Photon-Limited Image Reconstruction
The techniques described in this paper allow multiscale photon-limited image reconstruction methods to be implemented with significantly less computational complexity than previou...
Rebecca Willett, Robert Nowak
TOG
2008
145views more  TOG 2008»
14 years 11 months ago
Real-time KD-tree construction on graphics hardware
We present an algorithm for constructing kd-trees on GPUs. This algorithm achieves real-time performance by exploiting the GPU's streaming architecture at all stages of kd-tr...
Kun Zhou, Qiming Hou, Rui Wang 0004, Baining Guo
INFOCOM
2000
IEEE
15 years 4 months ago
Near Optimal Routing Lookups with Bounded Worst Case Performance
Abstract—The problem of route address lookup has received much attention recently and several algorithms and data structures for performing address lookups at high speeds have be...
Pankaj Gupta, Balaji Prabhakar, Stephen P. Boyd
MIDDLEWARE
2010
Springer
14 years 10 months ago
FaReCast: Fast, Reliable Application Layer Multicast for Flash Dissemination
Abstract. To disseminate messages from a single source to a large number of targeted receivers, a natural approach is the tree-based application layer multicast (ALM). However, in ...
Kyungbaek Kim, Sharad Mehrotra, Nalini Venkatasubr...
CORR
2008
Springer
167views Education» more  CORR 2008»
14 years 11 months ago
Fast k Nearest Neighbor Search using GPU
Statistical measures coming from information theory represent interesting bases for image and video processing tasks such as image retrieval and video object tracking. For example...
Vincent Garcia, Eric Debreuve, Michel Barlaud