251 search results - page 30 / 51 » Polynomial Time Algorithms for Three-Label Point Labeling |
ROBOCOMM
2007
IEEE
14 years 3 months ago
2007
IEEE
—For the first time, the problem of optimizing energy for communication and motion is investigated. We consider a single mobile robot with continuous high bandwidth wireless com...
CIDM
2007
IEEE
14 years 21 days ago
2007
IEEE
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
NIPS
2003
13 years 10 months ago
2003
The 2-class transduction problem, as formulated by Vapnik [1], involves finding a separating hyperplane for a labelled data set that is also maximally distant from a given set of...
NIPS
2007
13 years 10 months ago
2007
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
COMPGEOM
2005
ACM
13 years 10 months ago
2005
ACM
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...