1012 search results - page 57 / 203 » Segment intersection searching problems in general settings |
106
click to vote
COCO
2004
Springer
15 years 3 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
GECCO
2005
Springer
15 years 5 months ago
2005
Springer
This paper is concerned with a specific brand of evolutionary algorithms: Memetic algorithms. A new local search technique with an adaptive neighborhood setting process is introdu...
SIGMOD
2010
ACM
14 years 9 months ago
2010
ACM
More and more important data is accumulated inside social networks. Limiting the flow of private information across a social network is very important, and most social networks pr...
WWW
2010
ACM
15 years 13 hour ago
2010
ACM
We study the problem of anonymizing user profiles so that user privacy is sufficiently protected while the anonymized profiles are still effective in enabling personalized web sea...
191
click to vote
SIGMOD
2006
ACM
15 years 12 months ago
2006
ACM
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...