2996 search results - page 126 / 600 » Numberings and Randomness |
175
Voted
MCS
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. We report on our recent progress in developing an ensemble of classifiers based algorithm for addressing the missing feature problem. Inspired in part by the random subsp...
132
click to vote
CLUSTER
2006
IEEE
15 years 11 months ago
2006
IEEE
The RandomAccess benchmark as defined by the High Performance Computing Challenge (HPCC) tests the speed at which a machine can update the elements of a table spread across globa...
153
click to vote
ISCIS
2005
Springer
15 years 11 months ago
2005
Springer
Dense subgraphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Computing them however is generally expe...
134
click to vote
CP
2004
Springer
15 years 10 months ago
2004
Springer
Many backtracking algorithms exhibit heavy-tailed distributions, in which their running time is often much longer than their median. We analyze the behavior of two natural variant...
141
click to vote
ISQED
2003
IEEE
15 years 10 months ago
2003
IEEE
We discuss a non-intrusive methodology for concurrent fault detection in random combinational logic. The proposed method is similar to duplication, wherein a replica of the circui...