1007 search results - page 127 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
185
click to vote
SSD
2007
Springer
15 years 8 months ago
2007
Springer
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
157
Voted
SPAA
1994
ACM
15 years 6 months ago
1994
ACM
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
110
Voted
GECCO
2009
Springer
15 years 9 months ago
2009
Springer
This work examines the dendritic cell algorithm (DCA) from a mathematical perspective. By representing the signal processing phase of the algorithm using the dot product it is sho...
197
Voted
SIGMOD
2008
ACM
16 years 2 months ago
2008
ACM
Pattern matching over event streams is increasingly being employed in many areas including financial services, RFIDbased inventory management, click stream analysis, and electroni...
130
Voted
IPPS
1997
IEEE
15 years 6 months ago
1997
IEEE
Tools for parallel systems today range from specification over debugging to performance analysis and more. Typically, they help the programmers of parallel algorithms from the ea...