Sciweavers

221 search results - page 10 / 45
» An Improved Approximation Algorithm for the Column Subset Se...
Sort
View
ICC
2009
IEEE
140views Communications» more  ICC 2009»
13 years 5 months ago
Approximation Algorithms for Traffic Grooming in WDM Rings
Abstract-- This paper addresses the problem of traffic grooming in WDM rings in which all traffic emanates from a single node and all other nodes are destination nodes. This "...
Kevin Corcoran, Seth Flaxman, Mark Neyer, Peter Sc...
SODA
1997
ACM
93views Algorithms» more  SODA 1997»
13 years 8 months ago
Fast Approximate Graph Partitioning Algorithms
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
Guy Even, Joseph Naor, Satish Rao, Baruch Schieber
ICPR
2008
IEEE
14 years 1 months ago
Adaptive asymmetrical SVM and genetic algorithms based iris recognition
We propose Genetic Algorithms to improve the feature subset selection by combining the valuable outcomes from multiple feature selection methods. This paper also motivates the use...
Kaushik Roy 0002, Prabir Bhattacharya
JMLR
2006
145views more  JMLR 2006»
13 years 7 months ago
Ensemble Pruning Via Semi-definite Programming
An ensemble is a group of learning models that jointly solve a problem. However, the ensembles generated by existing techniques are sometimes unnecessarily large, which can lead t...
Yi Zhang 0006, Samuel Burer, W. Nick Street
IROS
2006
IEEE
104views Robotics» more  IROS 2006»
14 years 1 months ago
Landmark Selection for Task-Oriented Navigation
—Many vision-based navigation systems are restricted to the use of only a limited number of landmarks when computing the camera pose. This limitation is due to the overhead of de...
Ronen Lerner, Ehud Rivlin, Ilan Shimshoni