1632 search results - page 147 / 327 » Sublinear Time Algorithms for Metric Space Problems |
152
click to vote
CSCW
2002
ACM
15 years 3 months ago
2002
ACM
Bitmap-based collaborative graphics editing systems are a special class of real-time collaborative editing systems. Undo is an important and difficult problem in these systems. Ex...
130
click to vote
KDD
2009
ACM
16 years 4 months ago
2009
ACM
Counting the number of triangles in a graph is a beautiful algorithmic problem which has gained importance over the last years due to its significant role in complex network analy...
126
click to vote
SODA
1996
ACM
15 years 5 months ago
1996
ACM
Given a convex polygon P with m vertices and a set S of n points in the plane, we consider the problem of nding a placement of P that contains the maximum number of points in S. W...
122
click to vote
FOCS
2006
IEEE
15 years 10 months ago
2006
IEEE
We investigate the optimality of (1+ )-approximation algorithms obtained via the dimensionality reduction method. We show that: • Any data structure for the (1 + )-approximate n...
142
click to vote
EWSN
2009
Springer
16 years 4 months ago
2009
Springer
The problem of configuration of Wireless Sensor Networks is an interesting challenge. The objective is to find the settings, for each sensor node, that optimise certain task-level ...