Sciweavers

2342 search results - page 41 / 469
» Sublinear geometric algorithms
Sort
View
HAIS
2012
Springer
12 years 5 months ago
Generalized Weighted Majority Voting with an Application to Algorithms Having Spatial Output
In this paper we propose a method using a generalization of the weighted majority voting scheme to locate the optic disc (OD) in retinal images automatically. The location with the...
Henrietta Toman, Laszlo Kovacs, Agnes Jonas, Lajos...
WEA
2010
Springer
311views Algorithms» more  WEA 2010»
14 years 4 months ago
Geometric Minimum Spanning Trees with GeoFilterKruskal
Let P be a set of points in Rd . We propose GEOFILTERKRUSKAL, an algorithm that computes the minimum spanning tree of P using well separated pair decomposition in combination with ...
Samidh Chatterjee, Michael Connor, Piyush Kumar
GEOINFO
2004
13 years 11 months ago
Tratamento de Erros de Arredondamento na Biblioteca TerraLib
: In this paper we approach the problems of rounding errors in geometric algorithms. Particularly, we are interested in geometric algorithms used by TerraLib
Jaudete Daltio, Marcus Vinícius Alvim Andra...
CORR
2008
Springer
98views Education» more  CORR 2008»
13 years 10 months ago
Void Traversal for Guaranteed Delivery in Geometric Routing
Geometric routing algorithms like GFG (GPSR) are lightweight, scalable algorithms that can be used to route in resource-constrained ad hoc wireless networks. However, such algorith...
Mikhail Nesterenko, Adnan Vora
GECCO
2005
Springer
143views Optimization» more  GECCO 2005»
14 years 3 months ago
Solving geometric TSP with ants
This paper presents an ant-based approach for solving the Traveling Salesman Problem (TSP). Novel concepts of this algorithm that distinguish it from the other heuristics are the ...
Thang Nguyen Bui, Mufit Colpan