10156 search results - page 118 / 2032 » Step by Step to Histories |
204
Voted
TRECVID
2007
15 years 8 months ago
2007
In this paper, we describe our approach and results for high-level feature extraction task at TRECVID 2007. This year, we adopted late fusion of several types of features. As a ï¬...
187
Voted
AIPS
2009
15 years 8 months ago
2009
Planning based on propositional SAT(isfiability) is a powerful approach to computing step-optimal plans given a parallel execution semantics. In this setting: (i) a solution plan ...
174
click to vote
ENDM
2008
15 years 7 months ago
2008
We give an algorithm to morph between two planar drawings of a graph, preserving planarity, but allowing edges to bend. The morph uses a polynomial number of elementary steps, whe...
167
click to vote
ICRA
2010
IEEE
15 years 5 months ago
2010
IEEE
— We present here an original approach to test the feasibility of footsteps for a given walking pattern generator. It is based on a new approximation algorithm intended to cope w...
166
Voted
MTPP
2010
15 years 4 months ago
2010
Abstract. The code generator in a compiler attempts to match a subject tree against a collection of tree-shaped patterns for generating instructions. Tree-pattern matching may be c...