Sciweavers

306 search results - page 38 / 62
» Parameterized matching with mismatches
Sort
View
SPIRE
2004
Springer
14 years 1 months ago
Longest Motifs with a Functionally Equivalent Central Block
This paper presents a generalization of the notion of longest repeats with a block of k don’t care symbols introduced by [8] (for k fixed) to longest motifs composed of three pa...
Maxime Crochemore, Raffaele Giancarlo, Marie-Franc...
CAISE
2006
Springer
13 years 11 months ago
A Tool for Semi-Automated Semantic Schema Mapping: Design and Implementation
Recently, schema mapping has found considerable interest in both research and practice. Determining matching components of database or XML schemas is needed in many applications, e...
Dimitris Manakanatas, Dimitris Plexousakis
CIKM
2009
Springer
14 years 2 months ago
Effective and efficient structured retrieval
Search engines that support structured documents typically support structure created by the author (e.g., title, section), and may also support structure added by an annotation pr...
Le Zhao, Jamie Callan
ISLPED
2003
ACM
95views Hardware» more  ISLPED 2003»
14 years 1 months ago
Power efficient comparators for long arguments in superscalar processors
Traditional pulldown comparators that are used to implement associativeaddressing logic in superscalar microprocessors dissipate energy on a mismatch in any bit position in the co...
Dmitry Ponomarev, Gurhan Kucuk, Oguz Ergin, Kanad ...
CORR
2008
Springer
109views Education» more  CORR 2008»
13 years 8 months ago
Low-Complexity Structured Precoding for Spatially Correlated MIMO Channels
The focus of this paper is on spatial precoding in correlated multi-antenna channels, where the number of independent data-streams is adapted to trade-off the data-rate with the t...
Vasanthan Raghavan, Akbar M. Sayeed, Venugopal V. ...