1431 search results - page 103 / 287 » The complexity of random ordered structures |
137
click to vote
IJPRAI
2010
15 years 1 months ago
2010
: AUC-SVM directly maximizes the area under the ROC curve (AUC) through minimizing its hinge loss relaxation, and the decision function is determined by those support vector sample...
186
click to vote
SIGMOD
2012
ACM
13 years 5 months ago
2012
ACM
While extensive work has been done on evaluating queries over tuple-independent probabilistic databases, query evaluation over correlated data has received much less attention eve...
117
click to vote
ICC
2008
IEEE
15 years 9 months ago
2008
IEEE
— Low-Density Parity-Check (LDPC) codes are typically characterized by a relatively high-complexity description, since a considerable amount of memory is required in order to sto...
133
Voted
VISUALIZATION
2002
IEEE
15 years 8 months ago
2002
IEEE
We present a robust, noise-resistant criterion characterizing planelike skeletons in binary voxel objects. It is based on a distance map and the geodesic distance along the object...
136
click to vote
VISUALIZATION
1992
IEEE
15 years 7 months ago
1992
IEEE
algorithms as networks of modules. The data flow architecture is popular because of the flexibility of mixing calculation modules with display modules, and because of its easy grap...