4112 search results - page 715 / 823 » Efficient Algorithms for the Spoonerism Problem |
131
click to vote
ICDE
2010
IEEE
16 years 6 months ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
177
click to vote
ICC
2007
IEEE
16 years 22 days ago
2007
IEEE
— Virtual Private Networks (VPN) provide a secure and reliable communication between customer sites over a shared network. With increase in number and size of VPNs, providers nee...
191
click to vote
DEBS
2007
ACM
15 years 10 months ago
2007
ACM
Content-based publish/subscribe systems allow matching the content of events with predicates in the subscriptions. However, most existing systems only allow a limited set of opera...
203
click to vote
DIS
2006
Springer
15 years 8 months ago
2006
Springer
Knowledge discovery systems are constrained by three main limited resources: time, memory and sample size. Sample size is traditionally the dominant limitation, but in many present...
179
click to vote
TSP
2008
15 years 6 months ago
2008
In this paper, we address the problem of orthogonal frequency-division multiplexing (OFDM) channel estimation in the presence of phase noise (PHN) and carrier frequency offset (CFO...