4860 search results - page 178 / 972 » SNPs Problems, Complexity, and Algorithms |
ICML
2007
IEEE
14 years 11 months ago
2007
IEEE
The k-Nearest Neighbors algorithm can be easily adapted to classify complex objects (e.g. sets, graphs) as long as a proper dissimilarity function is given over an input space. Bo...
ICRA
2009
IEEE
14 years 5 months ago
2009
IEEE
— This paper addresses two key limitations of the unscented Kalman filter (UKF) when applied to the simultaneous localization and mapping (SLAM) problem: the cubic, in the numbe...
ATAL
2005
Springer
14 years 3 months ago
2005
Springer
This paper presents an agent strategy for complex bilateral negotiations over many issues with inter-dependent valuations. We use ideas inspired by graph theory and probabilistic ...
DLOG
2006
13 years 11 months ago
2006
The novel context of accessing and querying large data repositories through ontologies that are formalized in terms of expressive DLs requires on the one hand to consider query an...
SSDBM
2007
IEEE
14 years 4 months ago
2007
IEEE
In high dimensional data, clusters often only exist in arbitrarily oriented subspaces of the feature space. In addition, these so-called correlation clusters may have complex rela...