359 search results - page 17 / 72 » Solving Geometric Covering Problems by Data Reduction |
148
Voted
ALENEX
2008
15 years 5 months ago
2008
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...
133
Voted
AAAI
2010
15 years 5 months ago
2010
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 ...
154
Voted
AAAI
2007
15 years 6 months ago
2007
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...
124
Voted
ACSC
2005
IEEE
15 years 9 months ago
2005
IEEE
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...
121
Voted
ICML
2007
IEEE
16 years 4 months ago
2007
IEEE
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 ...