Sciweavers

1272 search results - page 197 / 255
» Approximate Parameterized Matching
Sort
View
ICC
2008
IEEE
127views Communications» more  ICC 2008»
16 years 19 days ago
Pre-Equalization and Precoding Design for Frequency-Selective Fading Channels
— 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...
Lingyang Song, Are Hjørungnes, Manav R. Bha...
HPDC
2007
IEEE
16 years 15 days ago
Using content-addressable networks for load balancing in desktop grids
Desktop grids combine Peer-to-Peer and Grid computing techniques to improve the robustness, reliability and scalability of job execution infrastructures. However, efficiently mat...
Jik-Soo Kim, Peter J. Keleher, Michael A. Marsh, B...
GECCO
2007
Springer
190views Optimization» more  GECCO 2007»
16 years 10 days ago
Analysis of evolutionary algorithms for the longest common subsequence problem
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....
Thomas Jansen, Dennis Weyland
TELETRAFFIC
2007
Springer
16 years 9 days ago
Modeling and Predicting End-to-End Response Times in Multi-tier Internet Applications
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...
Sandjai Bhulai, Swaminathan Sivasubramanian, Rober...
COMPGEOM
2006
ACM
16 years 4 days ago
Lower bounds on locality sensitive hashing
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...
Rajeev Motwani, Assaf Naor, Rina Panigrahy