Sciweavers

325 search results - page 19 / 65
» Maximum margin planning
Sort
View
SWAT
1998
Springer
84views Algorithms» more  SWAT 1998»
13 years 12 months ago
Models and Motion Planning
We study the complexity of the motion planning problem for a bounded-reach robot in the situation where the n obstacles in its workspace satisfy two of the realistic models propos...
Mark de Berg, Matthew J. Katz, Mark H. Overmars, A...
DATAMINE
2010
133views more  DATAMINE 2010»
13 years 7 months ago
Using background knowledge to rank itemsets
Assessing the quality of discovered results is an important open problem in data mining. Such assessment is particularly vital when mining itemsets, since commonly many of the disc...
Nikolaj Tatti, Michael Mampaey
ACCV
2010
Springer
13 years 2 months ago
Pedestrian Recognition with a Learned Metric
This paper presents a new method for viewpoint invariant pedestrian recognition problem. We use a metric learning framework to obtain a robust metric for large margin nearest neigh...
Mert Dikmen, Emre Akbas, Thomas S. Huang, Narendra...
ICASSP
2009
IEEE
14 years 2 months ago
A complex cross-spectral distribution model using Normal Variance Mean Mixtures
We propose a model for the density of cross-spectral coefficients using Normal Variance Mean Mixtures. We show that this model density generalizes the corresponding marginal dens...
Jason A. Palmer, Scott Makeig, Kenneth Kreutz-Delg...
MICAI
2005
Springer
14 years 1 months ago
Maximizing Future Options: An On-Line Real-Time Planning Method
Abstract. In highly dynamic environments with uncertainty the elaboration of long or rigid plans is useless because the constructed plans are frequently dismissed by the arrival or...
Ramón F. Brena, Emmanuel Martinez