2124 search results - page 138 / 425 » Aggregating time partitions |
133
click to vote
ISPD
2005
ACM
15 years 9 months ago
2005
ACM
In this paper, we develop a mixed-size placement tool, Dragon2005, to solve large scale placement problems effectively. A top-down hierarchical approach based on min-cut partition...
142
click to vote
WG
2005
Springer
15 years 9 months ago
2005
Springer
Partitive set families are families of sets that can be quite large, but have a compact, recursive representation in the form of a tree. This tree is a common generalization of PQ...
131
Voted
CORR
2010
Springer
15 years 4 months ago
2010
Springer
This paper proposes an efficient technique for partitioning large biometric database during identification. In this technique feature vector which comprises of global and local de...
121
click to vote
DAM
2007
15 years 3 months ago
2007
We study the problem of uniformly partitioning the edge set of a tree with n edges into k connected components, where k ≤ n. The objective is to minimize the ratio of the maximu...
155
click to vote
ICCS
2009
Springer
15 years 10 months ago
2009
Springer
Irregular and sparse scientific computing programs frequently experience performance losses due to inefficient use of the memory system in most machines. Previous work has shown t...