Sciweavers

232 search results - page 26 / 47
» Large-scale Boolean matching
Sort
View
CVPR
2008
IEEE
15 years 4 months ago
Action recognition with motion-appearance vocabulary forest
In this paper we propose an approach for action recognition based on a vocabulary forest of local motionappearance features. Large numbers of features with associated motion vecto...
Krystian Mikolajczyk, Hirofumi Uemura
RTA
2007
Springer
15 years 3 months ago
Tom: Piggybacking Rewriting on Java
We present the Tom language that extends Java with the purpose of providing high level constructs inspired by the rewriting community. Tom furnishes a bridge between a general purp...
Emilie Balland, Paul Brauner, Radu Kopetz, Pierre-...
ANOR
2008
93views more  ANOR 2008»
14 years 9 months ago
Pruning in column generation for service vehicle dispatching
Abstract Column generation techniques have become a widely used technique to successfully solve large (integer) linear programs. One of the keys to obtaining a practically efficien...
Stephan Westphal, Sven Oliver Krumke
ICCAD
1997
IEEE
117views Hardware» more  ICCAD 1997»
15 years 1 months ago
Generalized matching from theory to application
This paper presents a novel approach for post-mapping optimization. We exploit the concept of generalized matching, a technique that nds symbolically all possible matching assignm...
Patrick Vuillod, Luca Benini, Giovanni De Micheli
ICALP
2009
Springer
15 years 10 months ago
Bounds on the Size of Small Depth Circuits for Approximating Majority
In this paper, we show that for every constant 0 < < 1/2 and for every constant d 2, the minimum size of a depth d Boolean circuit that -approximates Majority function on n ...
Kazuyuki Amano