4131 search results - page 388 / 827 » Compactness in Topology and Computation |
153
click to vote
CVPR
2010
IEEE
16 years 3 months ago
2010
IEEE
This paper overviews a new gesture recognition framework
based on learning local motion signatures (LMSs) introduced
by [1]. After the generation of these LMSs computed
on one i...
179
click to vote
CVPR
2010
IEEE
16 years 3 months ago
2010
IEEE
Maji and Berg [13] have recently introduced an explicit feature map approximating the intersection kernel. This enables efficient learning methods for linear kernels to be applied...
173
click to vote
SPIN
2009
Springer
16 years 1 months ago
2009
Springer
Existing techniques for approximate storage of visited states in a model checker are too special-purpose and too DRAM-intensive. Bitstate hashing, based on Bloom filters, is good ...
161
Voted
HPCC
2007
Springer
16 years 29 days ago
2007
Springer
A new evaluation method is presented that employs cut sequence set (CSS) to analyze fault trees. A cut sequence is a set of basic events that fail in a specific order that can indu...
185
click to vote
STACS
2007
Springer
16 years 28 days ago
2007
Springer
Strategic games may exhibit symmetries in a variety of ways. A characteristic feature, enabling the compact representation of games even when the number of players is unbounded, i...