2542 search results - page 107 / 509 » Computing Cartograms with Optimal Complexity |
119
Voted
DEBS
2007
ACM
15 years 7 months ago
2007
ACM
Queries for composite events typically involve the four complementary dimensions of event data, event composition, relationships between events (esp. temporal and causal), and acc...
136
click to vote
AINA
2007
IEEE
15 years 3 months ago
2007
IEEE
A workflow aggregates the underlying Web Services in a manner consistent with the desired functionality. Since CWS can contain atomic and other CWS they encourage the development ...
109
Voted
WABI
2007
Springer
15 years 9 months ago
2007
Springer
Graph-theoretic models have come to the forefront as some of the most powerful and practical methods for sequence assembly. Simultaneously, the computational hardness of the underl...
145
Voted
ICMCS
2008
IEEE
15 years 9 months ago
2008
IEEE
We present an implementation of general FFTs for graphics processing units (GPUs). Unlike most existing GPU FFT implementations, we handle both complex and real data of any size t...
117
Voted
GIS
1999
ACM
15 years 7 months ago
1999
ACM
: The paper is concerned with the effective and efficient processing of spatiotemporal selection queries under varying degrees of approximation. Such queries may employ operators l...