1066 search results - page 124 / 214 » Computing Private Set Operations with Linear Complexities |
EOR
2007
14 years 9 months ago
2007
In this paper, a new model for the semi-obnoxious facility location problem is introduced. The new model is composed of a weighted minisum function to represent the transportation...
142
click to vote
INFOCOM
2011
IEEE
14 years 1 months ago
2011
IEEE
Abstract—This work proposes a novel connectivity-based localization algorithm, well suitable for large-scale sensor networks with complex shapes and non-uniform nodal distributio...
TSP
2010
14 years 4 months ago
2010
[1, 2] have shown for the dynamic spectrum allocation problem that a competitive market model (which sets a price for transmission power on each channel) leads to a greater social...
ECCV
2008
Springer
15 years 11 months ago
2008
Springer
Abstract. Affine registration has a long and venerable history in computer vision literature, and extensive work have been done for affine registrations in IR2 and IR3 . In this pa...
VMV
2008
14 years 11 months ago
2008
In computer graphics, procedural methods and Lsystems are common approaches to model complex botanical trees. In contrast to previous tree modeling systems, we propose linking rul...