1007 search results - page 150 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
126
click to vote
SIGMOD
2010
ACM
15 years 7 months ago
2010
ACM
Online aggregation is a promising solution to achieving fast early responses for interactive ad-hoc queries that compute aggregates on a large amount of data. Essential to the suc...
128
click to vote
ICASSP
2009
IEEE
15 years 6 months ago
2009
IEEE
We derive a recursive general-radix pruned Cooley-Tukey fast Fourier transform (FFT) algorithm in Kronecker product notation. The algorithm is compatible with vectorization and pa...
120
click to vote
ICIP
2007
IEEE
15 years 4 months ago
2007
IEEE
In this paper, we present a method based on tangent distance to estimate motion in image sequences. Tangent distance combines an intuitive understanding and effective modeling of ...
110
Voted
ICWS
2007
IEEE
15 years 3 months ago
2007
IEEE
There is a critical need to design and develop tools tract away the fundamental complexity of XML based Web services specifications and toolkits, and provide an elegant, intuitive...
170
Voted
ICDE
2011
IEEE
14 years 6 months ago
2011
IEEE
— In a wireless sensor network (WSN), each sensor monitors environmental parameters, and reports its readings to a base station, possibly through other nodes. A sensor works in c...