Sciweavers

7930 search results - page 598 / 1586
» Greedy in Approximation Algorithms
Sort
View
AAAI
2004
15 years 8 months ago
A Comparison of Techniques for Scheduling Earth Observing Satellites
Scheduling observations by coordinated fleets of Earth Observing Satellites (EOS) involves large search spaces, complex constraints and poorly understood bottlenecks; conditions w...
Al Globus, James Crawford, Jason D. Lohn, Anna Pry...
ESANN
2001
15 years 8 months ago
Graph extraction from color images
Abstract. An approach to symbolic contour extraction will be described that consists of three stages: enhancement, detection, and extraction of edges and corners. Edges and corners...
Tino Lourens, Kazuhiro Nakadai, Hiroshi G. Okuno, ...
AAAI
1993
15 years 8 months ago
Finding Accurate Frontiers: A Knowledge-Intensive Approach to Relational Learning
learning (EBL) component. In this paper we provide a brief review of FOIL and FOCL, then discuss how operationalizing a domain theory can adversely affect the accuracy of a learned...
Michael J. Pazzani, Clifford Brunk
ICASSP
2010
IEEE
15 years 7 months ago
Gradient Polytope Faces Pursuit for large scale sparse recovery problems
Polytope Faces Pursuit is a greedy algorithm that performs Basis Pursuit with similar order complexity to Orthogonal Matching Pursuit. The algorithm adds one basis vector at a tim...
Aris Gretsistas, Ivan Damnjanovic, Mark D. Plumble...
MMS
2006
15 years 7 months ago
Constructing task visibility intervals for video surveillance
Vision systems are increasingly being deployed to perform complex surveillance tasks. While improved algorithms are being developed to perform these tasks, it is also important tha...
Ser-Nam Lim, Larry S. Davis, Anurag Mittal