17688 search results - page 30 / 3538 » Data Set Balancing |
115
click to vote
ACTA
2010
15 years 2 months ago
2010
This paper describes an effective verification procedure for imperative programs that handle (balanced) tree-like data structures. Since the verification problem considered is unde...
102
click to vote
COMBINATORICS
2007
15 years 1 months ago
2007
It is well-known that Sturmian sequences are the non ultimately periodic sequences that are balanced over a 2-letter alphabet. They are also characterized by their complexity: the...
114
click to vote
IPPS
2006
IEEE
15 years 8 months ago
2006
IEEE
The development of efficient parallel out-of-core applications is often tedious, because of the need to explicitly manage the movement of data between files and data structures ...
117
click to vote
IPPS
1996
IEEE
15 years 6 months ago
1996
IEEE
A common statistical problem is that of nding the median element in a set of data. This paper presents a fastand portable parallel algorithm for nding the median given a set of el...
165
click to vote
COMPGEOM
2010
ACM
15 years 7 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...