1313 search results - page 144 / 263 » Data Discretization Unification |
COMPGEOM
2009
ACM
14 years 4 months ago
2009
ACM
We consider a number of range reporting problems in two and three dimensions and prove lower bounds on the amount of space used by any cache-oblivious data structure for these pro...
COMPGEOM
2006
ACM
14 years 2 months ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
CIKM
2011
Springer
12 years 10 months ago
2011
Springer
Modern computing systems generate large amounts of log data. System administrators or domain experts utilize the log data to understand and optimize system behaviors. Most system ...
KDD
2008
ACM
14 years 10 months ago
2008
ACM
We propose a visualization method based on a topic model for discrete data such as documents. Unlike conventional visualization methods based on pairwise distances such as multi-d...
KDD
2006
ACM
14 years 10 months ago
2006
ACM
Measuring distance or some other form of proximity between objects is a standard data mining tool. Connection subgraphs were recently proposed as a way to demonstrate proximity be...