Sciweavers

1147 search results - page 205 / 230
» Differential Matching Constraints
Sort
View
TCS
2008
13 years 9 months ago
Algorithms for subsequence combinatorics
A subsequence is obtained from a string by deleting any number of characters; thus in contrast to a substring, a subsequence is not necessarily a contiguous part of the string. Co...
Cees H. Elzinga, Sven Rahmann, Hui Wang
ISCI
2007
170views more  ISCI 2007»
13 years 9 months ago
Automatic learning of cost functions for graph edit distance
Graph matching and graph edit distance have become important tools in structural pattern recognition. The graph edit distance concept allows us to measure the structural similarit...
Michel Neuhaus, Horst Bunke
JCP
2007
243views more  JCP 2007»
13 years 9 months ago
Adaptive-Gain Kinematic Filters of Orders 2-4
- The kinematic filter is a common tool in control and signal processing applications dealing with position, velocity and other kinematical variables. Usually the filter gain is gi...
Naum Chernoguz
CCE
2005
13 years 9 months ago
New rigorous one-step MILP formulation for heat exchanger network synthesis
In this paper, a rigorous MILP formulation for grass-root design of heat exchanger networks is developed. The methodology does not rely on traditional supertargeting followed by n...
Andrés F. Barbaro, Miguel J. Bagajewicz
TSE
2008
113views more  TSE 2008»
13 years 9 months ago
Discovering Neglected Conditions in Software by Mining Dependence Graphs
Neglected conditions are an important but difficult-to-find class of software defects. This paper presents a novel approach for revealing neglected conditions that integrates stati...
Ray-Yaung Chang, Andy Podgurski, Jiong Yang