2382 search results - page 57 / 477 » Generating Seeded Trees from Data Sets |
148
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
128
click to vote
DAGSTUHL
2006
15 years 5 months ago
2006
This paper presents novel language and analysis techniques that significantly speed up software model checking of data structure properties. Consider checking a red-black tree imp...
135
click to vote
BIBM
2009
IEEE
15 years 9 months ago
2009
IEEE
The primary objective of disparities research is to model the differences across multiple groups and identify the groups that behave significantly different from each other. Indep...
151
click to vote
BMCBI
2008
15 years 4 months ago
2008
Background: The information from different data sets experimented under different conditions may be inconsistent even though they are performed with the same research objectives. ...
124
click to vote
EUROPAR
2007
Springer
15 years 10 months ago
2007
Springer
Selecting the close-to-optimal collective algorithm based on the parameters of the collective call at run time is an important step for achieving good performance of MPI applicatio...