1368 search results - page 132 / 274 » Perfect Local Computability and Computable Simulations |
121
click to vote
CVPR
2000
IEEE
15 years 5 months ago
2000
IEEE
Nearest neighbor classification assumes locally constant class conditional probabilities. This assumption becomes invalid in high dimensions with finite samples due to the curse o...
126
click to vote
CIC
2003
15 years 3 months ago
2003
One of the research problems in P2P computing is to look up and store the resource efficiently. The recent algorithms developed by several research groups for the lookup problem p...
127
click to vote
JCM
2007
15 years 1 months ago
2007
—Divisible loads are those workloads that can be partitioned by a scheduler into any arbitrary chunks. The problem of scheduling divisible loads has been defined for a long time,...
TSP
2008
15 years 1 months ago
2008
The most popular algorithms for blind equalization are the constant-modulus algorithm (CMA) and the ShalviWeinstein algorithm (SWA). It is well-known that SWA presents a higher co...
105
click to vote
IPPS
2010
IEEE
14 years 11 months ago
2010
IEEE
This paper presents and validates methods to extend reuse distance analysis of application locality characteristics to shared-memory multicore platforms by accounting for invalidat...