Sciweavers

237 search results - page 31 / 48
» Practical and Optimal String Matching
Sort
View
TCOM
2010
141views more  TCOM 2010»
13 years 1 months ago
Mutual Information Statistics and Beamforming Performance Analysis of Optimized LoS MIMO Systems
Abstract--This paper provides a systematic mutual information (MI) and multichannel beamforming (MBF) characterization of optimized multiple-input multiple-output (MIMO) communicat...
Michail Matthaiou, Paul de Kerret, George K. Karag...
INFOCOM
2000
IEEE
13 years 11 months ago
Near Optimal Routing Lookups with Bounded Worst Case Performance
Abstract—The problem of route address lookup has received much attention recently and several algorithms and data structures for performing address lookups at high speeds have be...
Pankaj Gupta, Balaji Prabhakar, Stephen P. Boyd
TCAD
1998
126views more  TCAD 1998»
13 years 6 months ago
Iterative remapping for logic circuits
Abstract—This paper presents an aggressive optimization technique targeting combinational logic circuits. Starting from an initial implementation mapped on a given technology lib...
Luca Benini, Patrick Vuillod, Giovanni De Micheli
SEMWEB
2007
Springer
14 years 26 days ago
Optimizing the Retrieval of Pertinent Answers for NL Questions with the E-Librarian Service
Abstract. There is a growing discrepancy between the creation of digital content and its actual employment and usefulness in a learning society. Technologies for recording lectures...
Serge Linckels, Harald Sack, Christoph Meinel
CPM
2005
Springer
100views Combinatorics» more  CPM 2005»
13 years 8 months ago
Hardness of Optimal Spaced Seed Design
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
François Nicolas, Eric Rivals