1015 search results - page 110 / 203 » The data locality of work stealing |
208
click to vote
CVPR
2012
IEEE
13 years 8 months ago
2012
IEEE
Current object class recognition systems typically target 2D bounding box localization, encouraged by benchmark data sets, such as Pascal VOC. While this seems suitable for the de...
167
click to vote
CC
2007
Springer
16 years 14 days ago
2007
Springer
As the amount of data used by programs increases due to the growth of hardware storage capacity and computing power, efficient memory usage becomes a key factor for performance. Si...
183
click to vote
SIGMOD
1998
ACM
15 years 10 months ago
1998
ACM
Most databases contain “name constants” like course numbers, personal names, and place names that correspond to entities in the real world. Previous work in integration of het...
155
click to vote
EMSOFT
2006
Springer
15 years 10 months ago
2006
Springer
We present a deadlock avoidance algorithm for distributed systems that guarantees liveness. Deadlock avoidance in distributed systems is a hard problem and general solutions are c...
159
click to vote
ENC
2006
IEEE
15 years 10 months ago
2006
IEEE
In this work, by using the local node refinement technique purposed in [2, 1], and a quad-tree type algorithm [3, 13], we built a global refinement technique for Kansa's unsy...