Sciweavers

556 search results - page 67 / 112
» Fast parallel GPU-sorting using a hybrid algorithm
Sort
View
SPAA
2005
ACM
14 years 2 months ago
The expansion and mixing time of skip graphs with applications
We prove that with high probability a skip graph contains a 4-regular expander as a subgraph, and estimate the quality of the expansion via simulations. As a consequence skip grap...
James Aspnes, Udi Wieder
CCGRID
2006
IEEE
14 years 14 days ago
Density-Based Clustering for Similarity Search in a P2P Network
P2P systems represent a large portion of the Internet traffic which makes the data discovery of great importance to the user and the broad Internet community. Hence, the power of ...
Mouna Kacimi, Kokou Yétongnon
ISPDC
2010
IEEE
13 years 6 months ago
A Distributed Wakening Based Target Tracking Protocol for Wireless Sensor Networks
We propose a two layer protocol for tracking fast targets in sensor networks. At the lower layer, the Distributed Spanning Tree Algorithm (DSTA) [12] partitions the network into c...
Aysegul Alaybeyoglu, Orhan Dagdeviren, Aylin Kanta...
ICASSP
2011
IEEE
13 years 14 days ago
Dual constrained TV-based regularization
Algorithms based on the minimization of the Total Variation are prevalent in computer vision. They are used in a variety of applications such as image denoising, compressive sensi...
Camille Couprie, Hugues Talbot, Jean-Christophe Pe...
ALGORITHMICA
2005
195views more  ALGORITHMICA 2005»
13 years 8 months ago
Bit-Parallel Witnesses and Their Applications to Approximate String Matching
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
Heikki Hyyrö, Gonzalo Navarro