5100 search results - page 755 / 1020 » The Linear Complexity of a Graph |
156
click to vote
IJCAI
2007
15 years 8 months ago
2007
Temporal reasoning is widely used within both Computer Science and A.I. However, the underlying complexity of temporal proof in discrete temporal logics has led to the use of simp...
183
click to vote
NIPS
2007
15 years 8 months ago
2007
A non–linear dynamic system is called contracting if initial conditions are forgotten exponentially fast, so that all trajectories converge to a single trajectory. We use contra...
195
click to vote
AAAI
2006
15 years 8 months ago
2006
Among various feature extraction algorithms, those based on genetic algorithms are promising owing to their potential parallelizability and possible applications in large scale an...
180
click to vote
HIS
2004
15 years 8 months ago
2004
Boosting is a general method for improving the accuracy of a learning algorithm. AdaBoost, short form for Adaptive Boosting method, consists of repeated use of a weak or a base le...
210
click to vote
SEBD
2001
15 years 8 months ago
2001
This paper introduces a new logical formalism, intended for temporal conceptual modelling, as a natural combination of the well-known description logic DLR and point-based linear ...