Sciweavers

16404 search results - page 788 / 3281
» A set coverage problem
Sort
View
IROS
2009
IEEE
165views Robotics» more  IROS 2009»
16 years 2 months ago
Autonomous altitude estimation of a UAV using a single onboard camera
Abstract— Autonomous estimation of the altitude of an Unmanned Aerial Vehicle (UAV) is extremely important when dealing with flight maneuvers like landing, steady flight, etc. ...
Anoop Cherian, Jonathan Andersh, Vassilios Morella...
WG
2007
Springer
16 years 1 months ago
Minimum-Weight Cycle Covers and Their Approximability
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
Bodo Manthey
CIARP
2005
Springer
16 years 1 months ago
Reward-Punishment Editing for Mixed Data
The KNN rule has been widely used in many pattern recognition problems, but it is sensible to noisy data within the training set, therefore, several sample edition methods have bee...
Raúl Rodríguez-Colín, Jes&uac...
SIGECOM
2004
ACM
105views ECommerce» more  SIGECOM 2004»
16 years 28 days ago
Mechanism design for online real-time scheduling
For the problem of online real-time scheduling of jobs on a single processor, previous work presents matching upper and lower bounds on the competitive ratio that can be achieved ...
Ryan Porter
MFCS
2004
Springer
16 years 26 days ago
Generating Paths and Cuts in Multi-pole (Di)graphs
Let G = (V, E) be a (directed) graph with vertex set V and edge (arc) set E. Given a set P of (source-sink) pairs of vertices of G, an important problem that arises in the computat...
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvic...