2638 search results - page 144 / 528 » Random Geometric Complexes |
164
click to vote
COLCOM
2007
IEEE
15 years 8 months ago
2007
IEEE
Abstract—Subscription covering detection is useful to improving the performance of any publish/subscribe system. However, an exact solution to querying coverings among a large se...
131
click to vote
AAAI
1998
15 years 7 months ago
1998
The typical difficulty of various NP-hard problems varies with simple parameters describing their structure. This behavior is largely independent of the search algorithm, but depe...
133
click to vote
WSC
1997
15 years 7 months ago
1997
We consider the effect of common random numbers (CRNs) among simulated systems in two different multinomial selection procedures; the classical procedure BEM (Bechhofer, Elmaghr...
174
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Depth of an object concerns a tradeoff between computation time and excess of program length over the shortest program length required to obtain the object. It gives an unconditio...
146
click to vote
PAMI
1998
15 years 6 months ago
1998
—Much of previous attention on decision trees focuses on the splitting criteria and optimization of tree sizes. The dilemma between overfitting and achieving maximum accuracy is ...