1836 search results - page 360 / 368 » Mining Clustering Dimensions |
ICSM
2008
IEEE
14 years 2 months ago
2008
IEEE
Up-to-date comments are critical for the successful evolution of a software application. When modifying a function, developers may update the comment associated with the function ...
COMPGEOM
2006
ACM
14 years 2 months ago
2006
ACM
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
PODC
2006
ACM
14 years 2 months ago
2006
ACM
This paper presents a distributed algorithm for wireless adhoc networks that runs in polylogarithmic number of rounds in the size of the network and constructs a lightweight, line...
ICDT
2001
ACM
14 years 26 days ago
2001
ACM
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
EDBT
2000
ACM
14 years 23 days ago
2000
ACM
In high-dimensional query processing, the optimization of the logical page-size of index structures is an important research issue. Even very simple query processing techniques suc...