153 search results - page 13 / 31 » Uniformity Testing Using Minimal Spanning Tree |
128
click to vote
ASIAMS
2007
IEEE
15 years 6 months ago
2007
IEEE
This talk has two parts explaining the significance of Rough sets in granular computing in terms of rough set rules and in uncertainty handling in terms of lower and upper approxi...
FOCS
2007
IEEE
15 years 6 months ago
2007
IEEE
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
ICPR
2006
IEEE
16 years 23 days ago
2006
IEEE
Graph-Spectral surface integration techniques construct an integration path assuming that the surface contains a path along which the integration error is minimal. This paper pres...
103
click to vote
CORR
2006
Springer
14 years 11 months ago
2006
Springer
A commonly used type of search tree is the alphabetic binary tree, which uses (without loss of generality) "less than" versus "greater than or equal to" tests ...
91
Voted
COMPSAC
2008
IEEE
15 years 6 months ago
2008
IEEE
Path-oriented Random Testing (PRT) aims at generating a uniformly spread out sequence of random test data that activate a single control flow path within an imperative program. T...