2124 search results - page 202 / 425 » Aggregating time partitions |
104
click to vote
ISCA
1998
IEEE
15 years 8 months ago
1998
IEEE
Much of the improvement in computer performance over the last twenty years has come from faster transistors and architectural advances that increase parallelism. Historically, par...
132
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We propose in this paper an exploratory analysis algorithm for functional data. The method partitions a set of functions into K clusters and represents each cluster by a simple pr...
128
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
The generalized traveling salesman problem (GTSP) is an extension of the well-known traveling salesman problem. In GTSP, we are given a partition of cities into groups and we are ...
118
click to vote
JSA
2006
15 years 4 months ago
2006
A NULL Cycle Reduction (NCR) technique is developed to increase the throughput of NULL Convention Logic systems, by reducing the time required to flush complete DATA wavefronts, c...
169
click to vote
CORR
1999
Springer
15 years 4 months ago
1999
Springer
We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph ...