Sciweavers

4541 search results - page 705 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
TPDS
2010
126views more  TPDS 2010»
15 years 1 months ago
Stabilizing Distributed R-Trees for Peer-to-Peer Content Routing
Publish/subscribe systems provide useful platforms for delivering data (events) from publishers to subscribers in a decoupled fashion. Developing efficient publish/subscribe scheme...
Silvia Bianchi, Pascal Felber, Maria Gradinariu Po...
ICCV
2007
IEEE
16 years 9 months ago
Joint Affinity Propagation for Multiple View Segmentation
A joint segmentation is a simultaneous segmentation of registered 2D images and 3D points reconstructed from the multiple view images. It is fundamental in structuring the data fo...
Jianxiong Xiao, Jingdong Wang, Ping Tan, Long Quan
ICIP
2002
IEEE
16 years 8 months ago
Full search content independent block matching based on the fast Fourier transform
In this paper, we present a new algorithm for solving the block matching problem which is independent of image content and is faster than other full-search methods. The method emp...
Mark S. Drew, Steven L. Kilthau, Torsten Möll...
PPOPP
2009
ACM
16 years 7 months ago
Comparability graph coloring for optimizing utilization of stream register files in stream processors
A stream processor executes an application that has been decomposed into a sequence of kernels that operate on streams of data elements. During the execution of a kernel, all stre...
Xuejun Yang, Li Wang, Jingling Xue, Yu Deng, Ying ...
STOC
2001
ACM
151views Algorithms» more  STOC 2001»
16 years 7 months ago
On the cell probe complexity of membership and perfect hashing
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
Rasmus Pagh