17688 search results - page 28 / 3538 » Data Set Balancing |
216
click to vote
ICDE
2006
IEEE
16 years 3 months ago
2006
IEEE
Counting in general, and estimating the cardinality of (multi-) sets in particular, is highly desirable for a large variety of applications, representing a foundational block for ...
ICALP
2001
Springer
15 years 6 months ago
2001
Springer
Abstract. In this paper we investigate automated methods for externalizing internal memory data structures. We consider a class of balanced trees that we call weight-balanced parti...
142
click to vote
GRAPHICSINTERFACE
2003
15 years 3 months ago
2003
With large volume data sets, it can be difficult to visualize the data all at once. Multiple views can address this problem by displaying details in areas of interest while still ...
108
click to vote
JDA
2008
15 years 1 months ago
2008
We show how to uniformly distribute data at random (not to be confounded with permutation routing) in two settings that are able to deal with massive data: coarse grained parallel...
101
click to vote
ICALP
2005
Springer
15 years 7 months ago
2005
Springer
We reduce the approximation factor for Vertex Cover to 2 − Θ( 1√ log n ) (instead of the previous 2 − Θ(log log n log n ), obtained by Bar-Yehuda and Even [2], and by Moni...