2124 search results - page 118 / 425 » Aggregating time partitions |
142
click to vote
SIGCOMM
2009
ACM
16 years 15 days ago
2009
ACM
To search the web quickly, search engines partition the web index over many machines, and consult every partition when answering a query. To increase throughput, replicas are adde...
186
click to vote
ICALP
2007
Springer
16 years 5 days ago
2007
Springer
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...
169
click to vote
ICTAI
2006
IEEE
16 years 1 days ago
2006
IEEE
We present an ensemble learning approach that achieves accurate predictions from arbitrarily partitioned data. The partitions come from the distributed processing requirements of ...
187
click to vote
ASPDAC
2000
ACM
15 years 10 months ago
2000
ACM
Multilevel Fiduccia-Mattheyses MLFM hypergraph partitioning 3, 22, 24 is a fundamental optimization in VLSI CAD physical design. The leading implementation, hMetis 23 , has sinc...
184
click to vote
ICPP
1998
IEEE
15 years 10 months ago
1998
IEEE
Exploiting locality at run-time is a complementary approach to a compiler approach for those applications with dynamic memory access patterns. This paper proposes a memory-layout ...