Sciweavers

583 search results - page 46 / 117
» Efficient algorithms for constructing decision trees with co...
Sort
View
SIAMJO
2000
101views more  SIAMJO 2000»
14 years 9 months ago
An Efficient Algorithm for Minimizing a Sum of p-Norms
We study the problem of minimizing a sum of p-norms where p is a fixed real number in the interval [1, ]. Several practical algorithms have been proposed to solve this problem. How...
Guoliang Xue, Yinyu Ye
CORR
2010
Springer
162views Education» more  CORR 2010»
14 years 9 months ago
Random sampling of lattice paths with constraints, via transportation
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...
Lucas Gerin
TCSV
2008
297views more  TCSV 2008»
14 years 9 months ago
Activity Analysis, Summarization, and Visualization for Indoor Human Activity Monitoring
Abstract--In this work, we study how continuous video monitoring and intelligent video processing can be used in eldercare to assist the independent living of elders and to improve...
Zhongna Zhou, Xi Chen, Yu-Chia Chung, Zhihai He, T...
ISER
2000
Springer
80views Robotics» more  ISER 2000»
15 years 1 months ago
Robot Navigation for Automatic Model Construction Using Safe Regions
: Automatic model construction is a core problem in mobile robotics. To solve this task efficiently, we need a motion strategy to guide a robot equipped with a range sensor through...
Héctor H. González-Baños, Jea...
ALGORITHMICA
2010
95views more  ALGORITHMICA 2010»
14 years 10 months ago
Homogeneous String Segmentation using Trees and Weighted Independent Sets
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...
Peter Damaschke