Sciweavers

2254 search results - page 56 / 451
» Computing the minimal covering set
Sort
View
ICPR
2002
IEEE
14 years 2 months ago
Uniformity Testing Using Minimal Spanning Tree
Testing for uniformity of multivariate data is the initial step in exploratory pattern analysis. We propose a new uniformity testing method, which first computes the maximum (sta...
Anil K. Jain, Xiaowei Xu, Tin Kam Ho, Fan Xiao
ESA
2005
Springer
162views Algorithms» more  ESA 2005»
14 years 3 months ago
Minimal Interval Completions
We study the problem of adding edges to an arbitrary graph so that the resulting graph is an interval graph. Our objective is to add an inclusion minimal set of edges, which means ...
Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve...
WADS
2007
Springer
98views Algorithms» more  WADS 2007»
14 years 4 months ago
Computing Best Coverage Path in the Presence of Obstacles in a Sensor Field
We study the presence of obstacles in computing BCP(s, t) (Best Coverage Path between two points s and t) in a 2D field under surveillance by sensors. Consider a set of m line seg...
Senjuti Basu Roy, Gautam Das, Sajal Das
IROS
2007
IEEE
193views Robotics» more  IROS 2007»
14 years 4 months ago
Data acquisition and view planning for 3-D modeling tasks
— In this paper we address the joint problems of automated data acquisition and view planning for large–scale indoor and outdoor sites. Our method proceeds in two distinct stag...
Paul Blaer, Peter K. Allen
DAGM
2006
Springer
14 years 1 months ago
Segmentation-Based Motion with Occlusions Using Graph-Cut Optimization
Abstract. We propose to tackle the optical flow problem by a combination of two recent advances in the computation of dense correspondences, namely the incorporation of image segme...
Michael Bleyer, Christoph Rhemann, Margrit Gelautz