844 search results - page 33 / 169 » Solving the p |
75
Voted
EDBT
2009
ACM
15 years 2 months ago
2009
ACM
In this paper, we identify and solve a new type of spatial queries, called continuous visible nearest neighbor (CVNN) search. Given a data set P, an obstacle set O, and a query li...
NETWORK
2006
14 years 9 months ago
2006
: The scalability of large-scale networked virtual environments (NVEs) suchastoday's Massively Multiplayer Online Games (MMOGs) faces inherent limits imposed by the client-ser...
78
Voted
CCCG
2008
14 years 11 months ago
2008
Let P be the point set in two dimensional plane. In this paper, we consider the problem of locating two isothetic unit squares such that together they cover maximum number of poin...
82
Voted
ICALP
2011
Springer
14 years 1 months ago
2011
Springer
We study a family of graph clustering problems where each cluster has to satisfy a certain local requirement. Formally, let µ be a function on the subsets of vertices of a graph G...
ISVD
2007
IEEE
15 years 4 months ago
2007
IEEE
We consider the problem of computing the time convex hull of a set of points in the presence of a straight-line highway in the plane. The traveling speed in the plane is assumed t...