Sciweavers

6581 search results - page 217 / 1317
» Formalizing Design Patterns
Sort
View
CPM
2000
Springer
143views Combinatorics» more  CPM 2000»
15 years 8 months ago
A Boyer-Moore Type Algorithm for Compressed Pattern Matching
Abstract. We apply the Boyer–Moore technique to compressed pattern matching for text string described in terms of collage system, which is a formal framework that captures variou...
Yusuke Shibata, Tetsuya Matsumoto, Masayuki Takeda...
ICMCS
2006
IEEE
142views Multimedia» more  ICMCS 2006»
15 years 9 months ago
Tricodes: A Barcode-Like Fiducial Design for Augmented Reality Media
Visual markers, or fiducials, have become one of the most common methods of camera pose estimation in Augmented Reality (AR) media. Many present day fiducial-based AR systems us...
Jonathan Mooser, Suya You, Ulrich Neumann
103
Voted
WWW
2008
ACM
16 years 4 months ago
SPARQL basic graph pattern optimization using selectivity estimation
In this paper, we formalize the problem of Basic Graph Pattern (BGP) optimization for SPARQL queries and main memory graph implementations of RDF data. We define and analyze the c...
Markus Stocker, Andy Seaborne, Abraham Bernstein, ...
ICALP
2001
Springer
15 years 8 months ago
Hidden Pattern Statistics
Abstract. We consider the sequence comparison problem, also known as “hidden pattern” problem, where one searches for a given subsequence in a text (rather than a string unders...
Philippe Flajolet, Yves Guivarc'h, Wojciech Szpank...
129
Voted
WER
1999
Springer
15 years 8 months ago
A Requirements Elicitation Approach Based in Templates and Patterns
One of the main problems of requirements elicitation is expressing customer requirements in a form that can be understood not only by requirements engineers but also by noncomputer...
Amador Durán Toro, B. Bernárdez Jim&...