Sciweavers

699 search results - page 84 / 140
» The method of combinatorial telescoping
Sort
View
111
Voted
ICRA
2009
IEEE
141views Robotics» more  ICRA 2009»
15 years 7 months ago
Detecting repeated motion patterns via Dynamic Programming using motion density
— In this paper, we propose a method that detects repeated motion patterns in a long motion sequence efficiently. Repeated motion patterns are the structured information that ca...
Koichi Ogawara, Yasufumi Tanabe, Ryo Kurazume, Tsu...
89
Voted
CVPR
2008
IEEE
15 years 7 months ago
Normalized tree partitioning for image segmentation
In this paper, we propose a novel graph based clustering approach with satisfactory clustering performance and low computational cost. It consists of two main steps: tree fitting...
Jingdong Wang, Yangqing Jia, Xian-Sheng Hua, Chang...
86
Voted
ICDM
2008
IEEE
160views Data Mining» more  ICDM 2008»
15 years 7 months ago
Direct Zero-Norm Optimization for Feature Selection
Zero-norm, defined as the number of non-zero elements in a vector, is an ideal quantity for feature selection. However, minimization of zero-norm is generally regarded as a combi...
Kaizhu Huang, Irwin King, Michael R. Lyu
87
Voted
IJCNN
2006
IEEE
15 years 6 months ago
Model Selection via Bilevel Optimization
— A key step in many statistical learning methods used in machine learning involves solving a convex optimization problem containing one or more hyper-parameters that must be sel...
Kristin P. Bennett, Jing Hu, Xiaoyun Ji, Gautam Ku...
117
Voted
GECCO
2009
Springer
172views Optimization» more  GECCO 2009»
15 years 5 months ago
Comparison of similarity measures for the multi-objective vehicle routing problem with time windows
The Vehicle Routing Problem can be seen as a fusion of two well known combinatorial problems, the Travelling Salesman Problem and Bin Packing Problem. It has several variants, the...
Abel Garcia-Najera, John A. Bullinaria