1510 search results - page 113 / 302 » Upper Probabilities and Additivity |
ICCD
2005
IEEE
15 years 6 months ago
2005
IEEE
Increasing cache latencies limit L1 cache sizes. In this paper we investigate restrictive compression techniques for level 1 data cache, to avoid an increase in the cache access l...
STACS
2009
Springer
15 years 4 months ago
2009
Springer
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted ...
ICDM
2008
IEEE
15 years 4 months ago
2008
IEEE
Selecting promising queries is the key to effective active learning. In this paper, we investigate selection techniques for the task of learning an equivalence relation where the ...
ROBIO
2006
IEEE
15 years 4 months ago
2006
IEEE
- Suddenly occurring collisions or unintentional motions represent a high safety risk in robotics and must be prevented. Especially for humanoid robots, the influence of disturbanc...
CC
2004
Springer
15 years 3 months ago
2004
Springer
In theory, increasing alias analysis precision should improve compiler optimizations on C programs. This paper compares alias analysis algorithms on scalar optimizations, including...