2703 search results - page 513 / 541 » Optimizing memory transactions |
100
Voted
EDBT
2004
ACM
16 years 24 days ago
2004
ACM
Abstract. Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) ...
95
Voted
EDBT
2006
ACM
16 years 24 days ago
2006
ACM
Recent years have seen growing interest in effective algorithms for summarizing and querying massive, high-speed data streams. Randomized sketch synopses provide accurate approxima...
95
Voted
ICFP
2007
ACM
16 years 19 days ago
2007
ACM
In this paper we present an automated way of using spare CPU resources within a shared memory multi-processor or multi-core machine. Our approach is (i) to profile the execution o...
107
Voted
ICDE
2010
IEEE
16 years 12 days ago
2010
IEEE
Similarity joins have been studied as key operations in multiple application domains, e.g., record linkage, data cleaning, multimedia and video applications, and phenomena detectio...
94
Voted
ICCAD
2008
IEEE
15 years 9 months ago
2008
IEEE
— In today’s VLSI designs, there can be many blockages in a routing region. The obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem has become an important prob...