Sciweavers

232 search results - page 28 / 47
» Large-scale Boolean matching
Sort
View
CVIU
2011
14 years 4 months ago
Action recognition with appearance-motion features and fast search trees
In this paper we propose an approach for action recognition based on a vocabulary of local motion-appearance features and fast approximate search in a large number of trees. Large...
Krystian Mikolajczyk, Hirofumi Uemura
TCS
2008
14 years 9 months ago
Semantic subtyping for the pi-calculus
Subtyping relations for the -calculus are usually defined in a syntactic way, by means of structural rules. We propose a semantic characterisation of channel types and use it to d...
Giuseppe Castagna, Rocco De Nicola, Daniele Varacc...
IVC
2007
131views more  IVC 2007»
14 years 9 months ago
Multi-view correspondence by enforcement of rigidity constraints
Establishing the correct correspondence between features in an image set remains a challenging problem amongst computer vision researchers. In fact, the combinatorial nature of fe...
Ricardo Oliveira, João Xavier, João ...
MFCS
2010
Springer
14 years 7 months ago
Weights of Exact Threshold Functions
We consider Boolean exact threshold functions defined by linear equations, and in general degree d polynomials. We give upper and lower bounds on the maximum magnitude (absolute va...
László Babai, Kristoffer Arnsfelt Ha...
JEI
2000
134views more  JEI 2000»
14 years 9 months ago
Pattern matching using the blur hit - miss transform
The usefulness of the hit-miss transform (HMT) and related transforms for pattern matching in document image applications is examined. Although the HMT is sensitive to the types o...
Dan S. Bloomberg, Luc Vincent