9842 search results - page 339 / 1969 » Problem complexity |
214
click to vote
LION
2007
Springer
16 years 29 days ago
2007
Springer
The importance of tuning a search algorithm for the specific features of the target search space has been known for quite some time. However, when dealing with multiobjective prob...
192
click to vote
CVPR
2007
IEEE
16 years 1 months ago
2007
IEEE
Energy-minimizing active contour models (snakes) have been proposed for solving many computer vision problems such as object segmentation, surface reconstruction, and object track...
183
click to vote
CEC
2010
IEEE
15 years 8 months ago
2010
IEEE
In this paper we present a simple and general new No Free Lunch-like result that applies to revisiting algorithms searching arbitrary problem sets. We begin by unifying the assumpt...
183
click to vote
CRYPTO
2005
Springer
16 years 11 days ago
2005
Springer
Motivated by database search problems such as partial match or nearest neighbor, we present secure multiparty computation protocols for constant-depth circuits. Specifically, for ...
175
click to vote
EUROCAST
2007
Springer
15 years 10 months ago
2007
Springer
RND (Radio Network Design) is an important problem in mobile telecommunications (for example in mobile/cellular telephony), being also relevant in the rising area of sensor network...