Sciweavers

253 search results - page 18 / 51
» The Sketching Complexity of Pattern Matching
Sort
View
CHB
2010
130views more  CHB 2010»
13 years 4 months ago
Building an interaction design pattern language: A case study
Interaction design patterns are a proven way to communicate good design. However, current pattern collections are not sufficiently powerful and generative to be used as a guide fo...
Stefan L. Pauwels, Christian Hübscher, Javier...
ICPR
2002
IEEE
14 years 10 months ago
Object Detection in Images: Run-Time Complexity and Parameter Selection of Support Vector Machines
In this paper we address two aspects related to the exploitation of Support Vector Machines (SVM) for classification in real application domains, such as the detection of objects ...
Nicola Ancona, Grazia Cicirelli, Ettore Stella, Ar...
IPPS
2006
IEEE
14 years 3 months ago
Implementation of a programmable array processor architecture for approximate string matching algorithms on FPGAs
Approximate string matching problem is a common and often repeated task in information retrieval and bioinformatics. This paper proposes a generic design of a programmable array p...
Panagiotis D. Michailidis, Konstantinos G. Margari...
ECOWS
2007
Springer
14 years 3 months ago
Service selection by choreography-driven matching
Abstract. The greater and greater quantity of services that are available over the web causes a growing attention to techniques that facilitate their reuse. A web service specific...
Matteo Baldoni, Cristina Baroglio, Alberto Martell...
COMPGEOM
2008
ACM
13 years 11 months ago
Embedding and similarity search for point sets under translation
Pattern matching in point sets is a well studied problem with numerous applications. We assume that the point sets may contain outliers (missing or spurious points) and are subjec...
Minkyoung Cho, David M. Mount