340 search results - page 14 / 68 » Efficient algorithms for bichromatic separability |
166
click to vote
CP
2009
Springer
15 years 10 months ago
2009
Springer
A problem that is inherent to the development and efficient use of solvers is that of tuning parameters. The CP community has a long history of addressing this task automatically. ...
PAISI
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. This paper introduces an efficient privacy-preserving protocol for distributed K-means clustering over an arbitrary partitioned data, shared among N parties. Clustering i...
101
click to vote
ICRA
2009
IEEE
14 years 7 months ago
2009
IEEE
In Simultaneous Localisation and Mapping (SLAM), it is well known that probabilistic filtering approaches which aim to estimate the robot and map state sequentially suffer from poo...
111
Voted
IDC
2009
Springer
14 years 7 months ago
2009
Springer
A major challenge faced in mobile ad hoc networks (MANETs) is locating devices for communication, especially in the case of high node mobility and sparse node density. Present solu...
AAAI
2010
14 years 4 months ago
2010
Objects in freely-drawn sketches often have no spatial or temporal separation, making object recognition difficult. We present a two-step stroke-grouping algorithm that first clas...