Sciweavers

221 search results - page 4 / 45
» The cost of not knowing the radius
Sort
View
ALENEX
2001
105views Algorithms» more  ALENEX 2001»
13 years 8 months ago
A Probabilistic Spell for the Curse of Dimensionality
Range searches in metric spaces can be very di cult if the space is \high dimensional", i.e. when the histogram of distances has a large mean and a small variance. The so-cal...
Edgar Chávez, Gonzalo Navarro
ICIP
2010
IEEE
13 years 5 months ago
Fast bilateral filtering by adapting block size
Direct implementations of bilateral filtering show O(r2 ) computational complexity per pixel, where r is the filter window radius. Several lower complexity methods have been devel...
Wei Yu, Franz Franchetti, James C. Hoe, Yao-Jen Ch...
SECON
2008
IEEE
14 years 1 months ago
Distributed Protocols for Finding Low-Cost Broadcast and Multicast Trees in Wireless Networks
Abstract—In this paper, we propose and evaluate two distributed protocols for finding low-cost broadcast and multicast trees in wireless networks. The constructed trees can then...
Nazanin Rahnavard, Badri N. Vellambi, Faramarz Fek...
GECCO
2003
Springer
14 years 20 days ago
An Evolutionary Algorithm for the Joint Replenishment of Inventory with Interdependent Ordering Costs
The joint replenishment of inventory problem (JRP) requires independence of minor ordering costs. In this paper we propose an evolutionary algorithm (EA) for a modification of the...
Anne L. Olsen
EVOW
2010
Springer
14 years 1 months ago
Evolving Individual Behavior in a Multi-agent Traffic Simulator
Abstract. In this paper, we illustrate the use of evolutionary agents in a multiagent system designed to describe the behavior of car drivers. Each agent has the selfish objective ...
Ernesto Sánchez, Giovanni Squillero, Albert...