Sciweavers

306 search results - page 11 / 62
» Parameterized matching with mismatches
Sort
View
ISORC
2003
IEEE
15 years 5 months ago
Integrating COTS Software Components into Dependable Software Architectures
sents some concluding remarks and discusses future work. This paper considers the problem of integrating commercial off-the-shelf (COTS) software components into systems with high ...
Paulo Asterio de Castro Guerra, Alexander B. Roman...
SIGIR
1999
ACM
15 years 4 months ago
Content-Based Retrieval for Music Collections
A content-based retrieval model for tackling the mismatch problems specific to music data is proposed and implemented. The system uses a pitch profile encoding for queries in any ...
Yuen-Hsien Tseng
NJC
1998
86views more  NJC 1998»
14 years 11 months ago
Parametric Permutation Routing via Matchings
The problem of routing permutations on graphs via matchings is considered, and we present a general algorithm which can be parameterized by different heuristics. This leads to a ...
Peter Høyer, Kim S. Larsen
ICWS
2010
IEEE
14 years 9 months ago
Semantic Annotations for WS-Policy
WS-Policy is a standard to express requirements and capabilities in Web service systems. Policies are based on domain-specific assertions. In this paper we present a lightweight ap...
Sebastian Speiser
91
Voted
CPM
1993
Springer
125views Combinatorics» more  CPM 1993»
15 years 3 months ago
Detecting False Matches in String Matching Algorithms
Consider a text string of length n, a pattern string of length m, and a match vector of length n which declares each location in the text to be either a mismatch (the pattern does ...
S. Muthukrishnan