1686 search results - page 268 / 338 » Programs as polygraphs: computability and complexity |
CVPR
2005
IEEE
16 years 2 months ago
2005
IEEE
We propose using the inner-distance between landmark points to build shape descriptors. The inner-distance is defined as the length of the shortest path between landmark points wi...
DAC
2000
ACM
16 years 1 months ago
2000
ACM
Contemporary microprocessors implement many iterative algorithms. For example, the front-end of a microprocessor repeatedly fetches and decodes instructions while updating interna...
120
Voted
ICML
2009
IEEE
16 years 1 months ago
2009
IEEE
Previous studies of Non-Parametric Kernel (NPK) learning usually reduce to solving some Semi-Definite Programming (SDP) problem by a standard SDP solver. However, time complexity ...
PPOPP
2009
ACM
16 years 1 months ago
2009
ACM
Transactional Memory (TM) is being studied widely as a new technique for synchronizing concurrent accesses to shared memory data structures for use in multi-core systems. Much of ...
94
Voted
HPCA
2006
IEEE
16 years 1 months ago
2006
IEEE
Building processors with large instruction windows has been proposed as a mechanism for overcoming the memory wall, but finding a feasible and implementable design has been an elu...