Sciweavers

140 search results - page 13 / 28
» Computing the visibility graph of points within a polygon
Sort
View
ACIVS
2005
Springer
15 years 10 months ago
Image Registration Using Uncertainty Transformations
Abstract. In this work we introduce a new technique for a frequently encountered problem in computer vision: image registration. The registration is computed by matching features, ...
Kristof Teelen, Peter Veelaert
DCOSS
2007
Springer
15 years 8 months ago
Efficient Computation of Minimum Exposure Paths in a Sensor Network Field
The exposure of a path p is a measure of the likelihood that an object traveling along p is detected by a network of sensors and it is formally defined as an integral over all poin...
Hristo Djidjev
WADS
2009
Springer
243views Algorithms» more  WADS 2009»
15 years 11 months ago
Resolving Loads with Positive Interior Stresses
We consider the pair (pi, fi) as a force with two-dimensional direction vector fi applied at the point pi in the plane. For a given set of forces we ask for a non-crossing geometri...
Günter Rote, André Schulz
USS
2010
15 years 2 months ago
BotGrep: Finding P2P Bots with Structured Graph Analysis
A key feature that distinguishes modern botnets from earlier counterparts is their increasing use of structured overlay topologies. This lets them carry out sophisticated coordina...
Shishir Nagaraja, Prateek Mittal, Chi-Yao Hong, Ma...
CORR
2010
Springer
180views Education» more  CORR 2010»
15 years 1 months ago
Shortest path problem in rectangular complexes of global nonpositive curvature
Abstract. CAT(0) metric spaces constitute a far-reaching common generalization of Euclidean and hyperbolic spaces and simple polygons: any two points x and y of a CAT(0) metric spa...
Victor Chepoi, Daniela Maftuleac