Sciweavers

2392 search results - page 18 / 479
» Matching data dissemination algorithms to application requir...
Sort
View
108
Voted
ICDAR
2005
IEEE
15 years 5 months ago
Handwriting Matching and Its Application to Handwriting Synthesis
Since it is extremely expensive to collect a large volume of handwriting samples, synthesized data are often used to enlarge the training set. We argue that, in order to generate ...
Yefeng Zheng, David S. Doermann
109
Voted
CCS
2010
ACM
14 years 12 months ago
User-friendly matching protocol for online social networks
In this paper, we outline a privacy-preserving matching protocol for OSN (online social network) users to find their potential friends. With the proposed protocol, a logged-in use...
Qiang Tang
85
Voted
DMSN
2006
ACM
15 years 5 months ago
Network scheduling for data archiving applications in sensor networks
Since data archiving in sensor networks is a communication intensive application, a careful power management of communication is of critical importance for such networks. An examp...
Yong Yao, S. M. Nazrul Alam, Johannes Gehrke, Serg...
ASAP
2004
IEEE
185views Hardware» more  ASAP 2004»
15 years 3 months ago
Families of FPGA-Based Algorithms for Approximate String Matching
Dynamic programming for approximate string matching is a large family of different algorithms, which vary significantly in purpose, complexity, and hardware utilization. Many impl...
Tom Van Court, Martin C. Herbordt
ALGORITHMICA
2005
195views more  ALGORITHMICA 2005»
14 years 11 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