2424 search results - page 279 / 485 » A general algorithm for data dependence analysis |
135
click to vote
JUCS
2008
15 years 4 months ago
2008
: Feature selection methods are often applied in the context of document classification. They are particularly important for processing large data sets that may contain millions of...
135
click to vote
COMPGEOM
2004
ACM
15 years 9 months ago
2004
ACM
The computation of Delaunay triangulations from static point sets has been extensively studied in computational geometry. When the points move with known trajectories, kinetic dat...
138
click to vote
COMPGEOM
2004
ACM
15 years 9 months ago
2004
ACM
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
131
click to vote
KDD
2010
ACM
15 years 8 months ago
2010
ACM
Compressing social networks can substantially facilitate mining and advanced analysis of large social networks. Preferably, social networks should be compressed in a way that they...
155
click to vote
DOLAP
2005
ACM
15 years 6 months ago
2005
ACM
Online Analytical Processing is a powerful framework for the analysis of organizational data. OLAP is often supported by a logical structure known as a data cube, a multidimension...