Sciweavers

3641 search results - page 66 / 729
» On Computability of Pattern Recognition Problems
Sort
View
DLT
2010
15 years 2 months ago
Inclusion Problems for Patterns with a Bounded Number of Variables
We study the inclusion problems for pattern languages that are generated by patterns with a bounded number of variables. This continues the work by Freydenberger and Reidenbach (In...
Joachim Bremer, Dominik D. Freydenberger
SLSFS
2005
Springer
15 years 6 months ago
Random Projection, Margins, Kernels, and Feature-Selection
Random projection is a simple technique that has had a number of applications in algorithm design. In the context of machine learning, it can provide insight into questions such as...
Avrim Blum
116
Voted
IBPRIA
2007
Springer
15 years 4 months ago
Non Parametric Classification of Human Interaction
This paper presents a non parametric method for classifying interactions between two people as taken from a video camera. A nearest neighbour classifier that uses trajectory matchi...
Scott Blunsden, Ernesto L. Andrade, Robert B. Fish...
98
Voted
ICFP
2008
ACM
16 years 15 days ago
Pattern minimization problems over recursive data types
In the context of program verification in an interactive theorem prover, we study the problem of transforming function definitions with ML-style (possibly overlapping) pattern mat...
Alexander Krauss
86
Voted
FCT
2005
Springer
15 years 6 months ago
A New Linearizing Restriction in the Pattern Matching Problem
In the pattern matching problem, there can be a quadratic number of matching substrings in the size of a given text. The linearizing restriction finds, at most, a linear number of...
Yo-Sub Han, Derick Wood