Sciweavers

4377 search results - page 56 / 876
» Mass problems and randomness
Sort
View
ICCV
1998
IEEE
15 years 11 months ago
A Metric for Distributions with Applications to Image Databases
Proceedings of the 1998 IEEE International Conference on Computer Vision, Bombay, India We introduce a new distance between two distributions that we call the Earth Mover's D...
Yossi Rubner, Carlo Tomasi, Leonidas J. Guibas
RECOMB
2001
Springer
15 years 10 months ago
Geometric algorithms for the analysis of 2D-electrophoresis gels
In proteomics 2?dimensional gel electrophoresis (2?DE) is a separation technique for proteins. The resulting protein spots can be identified by either using picking robots and sub...
Alon Efrat, Frank Hoffmann, Klaus Kriegel, Christo...
IROS
2009
IEEE
170views Robotics» more  IROS 2009»
15 years 4 months ago
Optimal trajectory design for parametric excitation walking
— Parametric excitation walking is one of methods that realize a passive dynamic like walking on the level ground. In parametric excitation walking, up-and-down motion of the cen...
Yoshihisa Banno, Yuji Harata, Kouichi Taji, Yoji U...
ICPR
2000
IEEE
15 years 11 months ago
Measuring the Complexity of Classification Problems
We studied a number of measures that characterize the difficulty of a classification problem. We compared a set of real world problems to random combinations of points in this mea...
Tin Kam Ho, Mitra Basu
ASIACRYPT
2001
Springer
15 years 2 months ago
The Modular Inversion Hidden Number Problem
We study a class of problems called Modular Inverse Hidden Number Problems (MIHNPs). The basic problem in this class is the following: Given many pairs xi, msbk (α + xi)−1 mod p...
Dan Boneh, Shai Halevi, Nick Howgrave-Graham