Sciweavers

103 search results - page 8 / 21
» Hierarchical Design of Fast Minimum Disagreement Algorithms
Sort
View
CVPR
2007
IEEE
14 years 1 months ago
Hierarchical Structuring of Data on Manifolds
Manifold learning methods are promising data analysis tools. However, if we locate a new test sample on the manifold, we have to find its embedding by making use of the learned e...
Jun Li, Pengwei Hao
IPPS
2006
IEEE
14 years 1 months ago
Node-disjoint paths in hierarchical hypercube networks
The hierarchical hypercube network is suitable for massively parallel systems. An appealing property of this network is the low number of connections per processor, which can faci...
Ruei-Yu Wu, J. G. Chang, Gen-Huey Chen
ICNP
1999
IEEE
13 years 12 months ago
Dynamic Memory Model Based Framework for Optimization of IP Address Lookup Algorithms
The design of software-based algorithms for fast IP address lookup targeted for general purpose processors has received tremendous attention in recent years due to its low cost im...
Gene Cheung, Steven McCanne
ICCAD
1993
IEEE
134views Hardware» more  ICCAD 1993»
13 years 11 months ago
Beyond the combinatorial limit in depth minimization for LUT-based FPGA designs
In this paper, we present an integrated approach to synthesis and mapping to go beyond the combinatorial limit set up by the depth-optimal FlowMap algorithm. The new algorithm, na...
Jason Cong, Yuzheng Ding
ICCV
2009
IEEE
13 years 5 months ago
Fast realistic multi-action recognition using mined dense spatio-temporal features
Within the field of action recognition, features and descriptors are often engineered to be sparse and invariant to transformation. While sparsity makes the problem tractable, it ...
Andrew Gilbert, John Illingworth, Richard Bowden