2771 search results - page 232 / 555 » A General Computational Treatment of the Comparative |
191
click to vote
SAC
2004
ACM
15 years 12 months ago
2004
ACM
The sequence mining problem consists in finding frequent sequential patterns in a database of time-stamped events. Several application domains require limiting the maximum tempor...
179
click to vote
VRST
2004
ACM
15 years 12 months ago
2004
ACM
In this paper we present an interactive collision detection algorithm for complex and deformable objects. For two target models, our approach rapidly calculates their region of in...
160
click to vote
GLVLSI
2003
IEEE
15 years 12 months ago
2003
IEEE
Octagonal Steiner Minimal Trees (OSMTs) are used in the global routing phase of pervasive octagonal VLSI layout. The OSMT problem seeks a minimal length spanning structure using e...
156
click to vote
GLVLSI
2003
IEEE
15 years 12 months ago
2003
IEEE
In this paper, we present a clustering based algorithm for acyclic multi-way partitioning. Many existing partitioning algorithms have shown that clustering can effectively improv...
164
click to vote
PPOPP
2003
ACM
15 years 11 months ago
2003
ACM
Gather and scatter are data redistribution functions of longstanding importance to high performance computing. In this paper, we present a highly-general array operator with power...