318 search results - page 25 / 64 » On the equivalence of linear complementarity problems |
ICCV
2007
IEEE
14 years 9 months ago
2007
IEEE
In this paper we propose a method for matching articulated shapes represented as large sets of 3D points by aligning the corresponding embedded clouds generated by locally linear ...
ICASSP
2009
IEEE
13 years 5 months ago
2009
IEEE
In this paper, we study transmission schemes for a novel OFDMbased MIMO system which performs adaptive signal combining in radio-frequency (RF). Specifically, we consider the prob...
ASIACRYPT
2009
Springer
14 years 2 months ago
2009
Springer
In this paper, an improved differential cryptanalysis framework for finding collisions in hash functions is provided. Its principle is based on linearization of compression functi...
IJCNLP
2004
Springer
14 years 27 days ago
2004
Springer
We study the problem of efficiently removing equal frequency n-gram substrings from an n-gram set, formally called Statistical Substring Reduction (SSR). SSR is a useful operatio...
LATIN
2004
Springer
14 years 27 days ago
2004
Springer
We consider the problem of protein folding in the HP model on the 3D square lattice. This problem is combinatorially equivalent to folding a string of 0’s and 1’s so that the s...