2609 search results - page 79 / 522 » Optimizing for parallelism and data locality |
124
Voted
SIGMOD
2010
ACM
15 years 23 days ago
2010
ACM
An increasing number of applications operate on data obtained from the Web. These applications typically maintain local copies of the web data to avoid network latency in data acc...
110
click to vote
GECCO
2005
Springer
15 years 6 months ago
2005
Springer
Memetic algorithms have become to gain increasingly important for solving large scale combinatorial optimization problems. Typically, the extent of the application of local search...
EUROPAR
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Program transformations are one of the most valuable compiler techniques to improve data locality. However, restructuring compilers have a hard time coping with data depe...
111
Voted
CVPR
2007
IEEE
16 years 2 months ago
2007
IEEE
In this paper, we present a system that integrates fully automatic scene geometry estimation, 2D object detection, 3D localization, trajectory estimation, and tracking for dynamic...
115
click to vote
ICDCS
2009
IEEE
15 years 9 months ago
2009
IEEE
Abstract: Current peer-to-peer systems are network-agnostic, often generating large volumes of unnecessary inter-ISP traffic. Although recent work has shown the benefits of ISP-a...