Sciweavers

3604 search results - page 288 / 721
» All Common Subsequences
Sort
View
ISAAC
2001
Springer
98views Algorithms» more  ISAAC 2001»
15 years 10 months ago
Fragmentary Pattern Matching: Complexity, Algorithms and Applications for Analyzing Classic Literary Works
A fragmentary pattern is a multiset of non-empty strings, and it matches a string w if all the strings in it occur within w without any overlaps. We study some fundamental issues o...
Hideaki Hori, Shinichi Shimozono, Masayuki Takeda,...
OOPSLA
2001
Springer
15 years 10 months ago
The Java Syntactic Extender
The ability to extend a language with new syntactic forms is a powerful tool. A sufficiently flexible macro system allows programmers to build from a common base towards a langua...
Jonathan Bachrach, Keith Playford
135
Voted
PFE
2001
Springer
15 years 10 months ago
Quantifying Product Line Benefits
Software product lines promise benefits like development and maintenance effort reduction, time to market decrease, and quality improvement, all resulting from planned and systemat...
Peter Knauber, Jesús Bermejo Muñoz, ...
SEMWEB
2001
Springer
15 years 10 months ago
An RDF Framework for Resource Discovery
Resource discovery is a problem common to almost all distributed systems. Instead of resulting in a one or a small number of discovery mechanisms, completely different and incompa...
Franklin Reynolds
ACSAC
2000
IEEE
15 years 10 months ago
Personal Security Environment on Palm PDA
Digital signature schemes are based on the assumption that the signing key is kept in secret. Ensuring that this assumption holds is one of the most crucial problems for all curre...
Margus Freudenthal, S. Heiberg, Jan Willemson