Sciweavers

359 search results - page 17 / 72
» Solving Geometric Covering Problems by Data Reduction
Sort
View
ALENEX
2008
180views Algorithms» more  ALENEX 2008»
13 years 9 months ago
Geometric Algorithms for Optimal Airspace Design and Air Traffic Controller Workload Balancing
The National Airspace System (NAS) is designed to accommodate a large number of flights over North America. For purposes of workload limitations for air traffic controllers, the a...
Amitabh Basu, Joseph S. B. Mitchell, Girishkumar S...
AAAI
2010
13 years 9 months ago
Multi-Instance Dimensionality Reduction
Multi-instance learning deals with problems that treat bags of instances as training examples. In single-instance learning problems, dimensionality reduction is an essential step ...
Yu-Yin Sun, Michael K. Ng, Zhi-Hua Zhou
AAAI
2007
13 years 10 months ago
Online Co-Localization in Indoor Wireless Networks by Dimension Reduction
This paper addresses the problem of recovering the locations of both mobile devices and access points from radio signals that come in a stream manner, a problem which we call onli...
Jeffrey Junfeng Pan, Qiang Yang, Sinno Jialin Pan
ACSC
2005
IEEE
14 years 1 months ago
A Two-Pronged Attack on the Dragon of Intractability
One approach to tractably finding a solution to an NP-complete optimisation problem is heuristic, where the solution is inexact but quickly found; another approach is to reduce t...
Stephen Gilmour, Mark Dras
ICML
2007
IEEE
14 years 8 months ago
Regression on manifolds using kernel dimension reduction
We study the problem of discovering a manifold that best preserves information relevant to a nonlinear regression. Solving this problem involves extending and uniting two threads ...
Jens Nilsson, Fei Sha, Michael I. Jordan