Sciweavers

419 search results - page 36 / 84
» Using Matrix Decompositions in Formal Concept Analysis
Sort
View
BIRD
2008
Springer
13 years 9 months ago
Efficient Seeding Techniques for Protein Similarity Search
Abstract. We apply the concept of subset seeds proposed in [1] to similarity search in protein sequences. The main question studied is the design of efficient seed alphabets to con...
Mikhail A. Roytberg, Anna Gambin, Laurent No&eacut...
AGTIVE
2003
Springer
14 years 29 days ago
Meta-Modelling, Graph Transformation and Model Checking for the Analysis of Hybrid Systems
Abstract. This paper presents the role of meta-modelling and graph transformation in our approach for the modelling, analysis and simulation of complex systems. These are made of c...
Juan de Lara, Esther Guerra, Hans Vangheluwe
TSP
2011
152views more  TSP 2011»
13 years 2 months ago
Blind Adaptive Constrained Constant-Modulus Reduced-Rank Interference Suppression Algorithms Based on Interpolation and Switched
—This work proposes a blind adaptive reduced-rank scheme and constrained constant-modulus (CCM) adaptive algorithms for interference suppression in wireless communications system...
Rodrigo C. de Lamare, Raimundo Sampaio Neto, Marti...
KBSE
2007
IEEE
14 years 2 months ago
Feature interaction analysis: a maintenance perspective
Software systems have become more complex, with myriad features and multiple functionalities. A major challenge in developing and maintaining such complex software is to identify ...
Maryam Shiri, Jameleddine Hassine, Juergen Rilling
KBSE
2005
IEEE
14 years 1 months ago
On dynamic feature location
Feature location aims at locating pieces of code that implement a given set of features (requirements). It is a necessary first step in every program comprehension and maintenanc...
Rainer Koschke, Jochen Quante