2157 search results - page 331 / 432 » Optimal Fast Hashing |
DC
2010
14 years 12 months ago
2010
It is considered good distributed computing practice to devise object implementations that tolerate contention, periods of asynchrony and a large number of failures, but perform f...
117
click to vote
DPD
2006
14 years 12 months ago
2006
A common technique used to minimize I/O in data intensive applications is data declustering over parallel servers. This technique involves distributing data among several disks so...
131
click to vote
TVCG
2011
14 years 6 months ago
2011
—This paper considers the problem of interactively finding the cutting contour to extract components from an existing mesh. First, we propose a constrained random walks algorith...
101
click to vote
Publication
This study investigates fast detection of the left ventricle (LV) endo- and epicardium boundaries in a cardiac magnetic resonance (MR) sequence following the optimization of two or...
114
click to vote
CVPR
2008
IEEE
16 years 1 months ago
2008
IEEE
This paper addresses the problem of recovering 3D human pose from a single monocular image, using a discriminative bag-of-words approach. In previous work, the visual words are le...