1272 search results - page 197 / 255 » Approximate Parameterized Matching |
91
Voted
ICC
2008
IEEE
15 years 5 months ago
2008
IEEE
— In this paper, we consider the joint transmitter and receiver design problem based on a novel approximate maximum likelihood decision feedback equalizer (A-ML-DFE) over frequen...
102
click to vote
HPDC
2007
IEEE
15 years 5 months ago
2007
IEEE
Desktop grids combine Peer-to-Peer and Grid computing techniques to improve the robustness, reliability and scalability of job execution infrastructures. However, efficiently mat...
101
click to vote
GECCO
2007
Springer
15 years 5 months ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
TELETRAFFIC
2007
Springer
15 years 5 months ago
2007
Springer
Many Internet applications employ multi-tier software architectures. The performance of such multi-tier Internet applications is typically measured by the end-toend response times...
COMPGEOM
2006
ACM
15 years 5 months ago
2006
ACM
Given a metric space (X, dX), c ≥ 1, r > 0, and p, q ∈ [0, 1], a distribution over mappings H : X → N is called a (r, cr, p, q)-sensitive hash family if any two points in...