256 search results - page 23 / 52 » A practical comparison of two K-Means clustering algorithms |
101
click to vote
FUIN
2010
14 years 10 months ago
2010
Some distributed constraint optimization algorithms use a linear number of messages in the number of agents, but of exponential size. This is often the main limitation for their pr...
106
click to vote
ICPADS
2005
IEEE
15 years 6 months ago
2005
IEEE
PageRank becomes the most well-known re-ranking technique of the search results. By its iterative computational nature, the computation takes much computing time and resource. Res...
128
click to vote
IMCSIT
2010
14 years 11 months ago
2010
Abstract--The paper proposes a model which allows integration of services published by independent providers into scientific or business workflows. Optimization algorithms are prop...
114
click to vote
SIGMOD
2002
ACM
16 years 1 months ago
2002
ACM
Dwarf is a highly compressed structure for computing, storing, and querying data cubes. Dwarf identifies prefix and suffix structural redundancies and factors them out by coalesci...
WOWMOM
2006
ACM
15 years 7 months ago
2006
ACM
Wireless broadband networks, especially WiMAX networks, have emerged in the industry recently and many challenging research issues arise. In this paper, we proposed a heuristic cl...