1872 search results - page 345 / 375 » The Art of Granular Computing |
CORR
2011
Springer
13 years 4 months ago
2011
Springer
Let f be a univariate polynomial with real coefficients, f ∈ R[X]. Subdivision algorithms based on algebraic techniques (e.g., Sturm or Descartes methods) are widely used for is...
HPCA
2012
IEEE
12 years 5 months ago
2012
IEEE
Phase change memory (PCM) recently has emerged as a promising technology to meet the fast growing demand for large capacity memory in modern computer systems. In particular, multi...
PPOPP
2012
ACM
12 years 5 months ago
2012
ACM
Speedups demonstrated for finding the biconnected components of a graph: 9x to 33x on the Explicit Multi-Threading (XMT) many-core computing platform relative to the best serial ...
CVPR
2009
IEEE
15 years 5 months ago
2009
IEEE
Support Vector Machines (SVM) are one of the most useful
techniques in classification problems. One clear example
is face recognition. However, SVM cannot be applied
when the fe...
CVPR
2009
IEEE
15 years 5 months ago
2009
IEEE
Radiometric variations between input images can seriously
degrade the performance of stereo matching algorithms.
In this situation, mutual information is a very popular
and powe...