Sciweavers

83 search results - page 5 / 17
» Analysis of Greedy Robot-Navigation Methods
Sort
View
STOC
2004
ACM
102views Algorithms» more  STOC 2004»
14 years 10 months ago
A simple polynomial-time rescaling algorithm for solving linear programs
The perceptron algorithm, developed mainly in the machine learning literature, is a simple greedy method for finding a feasible solution to a linear program (alternatively, for le...
John Dunagan, Santosh Vempala
ICMCS
2007
IEEE
195views Multimedia» more  ICMCS 2007»
14 years 4 months ago
Robust People Detection and Tracking in a Multi-Camera Indoor Visual Surveillance System
In this paper we describe the analysis component of an indoor, real-time, multi-camera surveillance system. The analysis includes: (1) a novel feature-level foreground segmentatio...
Tao Yang, Francine Chen, Don Kimber, Jim Vaughan
CLEF
2006
Springer
14 years 1 months ago
A High Precision Information Retrieval Method for WiQA
This paper presents Wolverhampton University's participation in the WiQA competition. The method chosen for this task combines a high precision, but low recall information re...
Constantin Orasan, Georgiana Puscasu
PRL
2010
173views more  PRL 2010»
13 years 8 months ago
Resolving stereo matching errors due to repetitive structures using model information
This study regards the problem of incorrect stereo matches due to the occurrence of repetitive structures in the scene. In stereo vision, repetitive structures may lead to “phan...
Björn Barrois, Marcus Konrad, Christian W&oum...
JCT
2007
117views more  JCT 2007»
13 years 9 months ago
Large independent sets in regular graphs of large girth
Let G be a d-regular graph with girth g, and let α be the independence number of G. We show that α(G) ≥ 1 2 1 − (d − 1)−2/(d−2) − (g) n where (g) → 0 as g → ∞,...
Joseph Lauer, Nicholas C. Wormald