5448 search results - page 1032 / 1090 » Breakpoints and Time in Distributed Computations |
123
click to vote
ICS
2009
Tsinghua U.
15 years 7 months ago
2009
Tsinghua U.
The L2 cache is commonly managed using LRU policy. For workloads that have a working set larger than L2 cache, LRU behaves poorly, resulting in a great number of less reused lines...
147
click to vote
EUROSYS
2010
ACM
15 years 6 months ago
2010
ACM
The deluge of huge data sets such as those provided by
sensor networks, online transactions, and the web provide
exciting opportunities for data analysis. The scale of the
data ...
108
click to vote
COMPGEOM
2010
ACM
15 years 5 months ago
2010
ACM
Let P be a set of n points in R3 . The 2-center problem for P is to find two congruent balls of the minimum radius whose union covers P. We present two randomized algorithms for ...
129
click to vote
ICCV
2007
IEEE
16 years 2 months ago
2007
IEEE
Reliable 3D tracking is still a difficult task. Most parametrized 3D deformable models rely on the accurate extraction of image features for updating their parameters, and are pro...
118
Voted
ECCV
2008
Springer
16 years 2 months ago
2008
Springer
As richer models for stereo vision are constructed, there is a growing interest in learning model parameters. To estimate parameters in Markov Random Field (MRF) based stereo formu...