28 search results - page 4 / 6 » Constructing small sample spaces satisfying given constraint... |
ESANN
2007
15 years 1 months ago
2007
We apply kernel-based machine learning methods to online learning situations, and look at the related requirement of reducing the complexity of the learnt classifier. Online meth...
NIPS
2007
15 years 1 months ago
2007
Clustering is often formulated as a discrete optimization problem. The objective is to find, among all partitions of the data set, the best one according to some quality measure....
IISWC
2008
IEEE
15 years 6 months ago
2008
IEEE
The design and evaluation of microprocessor architectures is a difficult and time-consuming task. Although small, handcoded microbenchmarks can be used to accelerate performance e...
MLQ
2008
14 years 11 months ago
2008
We present some general results concerning the topological space of cuts of a countable model of arithmetic given by a particular indicator Y . The notion of `indicator' is d...
ICRA
2000
IEEE
15 years 4 months ago
2000
IEEE
This paper presents a randomized motion planner for kinodynamic asteroidavoidanceproblems, in which a robot must avoid collision with moving obstacles under kinematic, dynamic con...