324 search results - page 61 / 65 » Efficient Approximation Algorithms for Floorplan Area Minimi... |
SODA
2010
ACM
14 years 5 months ago
2010
ACM
We present a simple and practical algorithm for the c-approximate near neighbor problem (c-NN): given n points P Rd and radius R, build a data structure which, given q Rd , can ...
PODC
2009
ACM
14 years 8 months ago
2009
ACM
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
VMV
2004
13 years 9 months ago
2004
Unstructured tetrahedral grids are a common data representation of three-dimensional scalar fields. For convex unstructured meshes efficient rendering methods are known. For conca...
ICNP
2006
IEEE
14 years 2 months ago
2006
IEEE
Abstract—We propose a solution to improve fairness and increase throughput in wireless networks with location information. Our approach consists of a multipath routing protocol, ...
VLDB
2008
ACM
14 years 8 months ago
2008
ACM
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...