Sciweavers

219 search results - page 26 / 44
» Time and Space Lower Bounds for Implementations Using k-CAS
Sort
View
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
14 years 1 months ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
WEA
2007
Springer
117views Algorithms» more  WEA 2007»
14 years 2 months ago
Better Landmarks Within Reach
We study the real algorithm for the point-to-point shortest path problem. It combines A∗ search search, landmark-based lower bounds, and reach-based pruning. We suggest several ...
Andrew V. Goldberg, Haim Kaplan, Renato Fonseca F....
ACCV
2007
Springer
14 years 2 months ago
Exploiting Inter-frame Correlation for Fast Video to Reference Image Alignment
Strong temporal correlation between adjacent frames of a video signal has been successfully exploited in standard video compression algorithms. In this work, we show that the tempo...
Arif Mahmood, Sohaib Khan
JPDC
2008
135views more  JPDC 2008»
13 years 8 months ago
Fast parallel GPU-sorting using a hybrid algorithm
This paper presents an algorithm for fast sorting of large lists using modern GPUs. The method achieves high speed by efficiently utilizing the parallelism of the GPU throughout th...
Erik Sintorn, Ulf Assarsson
SECON
2010
IEEE
13 years 6 months ago
Secondis: An Adaptive Dissemination Protocol for Synchronizing Wireless Sensor Networks
Reliability and predictability of the timing behavior have shown to be major issues for wireless sensor network deployments. Real-time requirements presented by several application...
Federico Ferrari, Andreas Meier, Lothar Thiele