1110 search results - page 45 / 222 » New Approximation Results for Resource Replication Problems |
151
click to vote
DATE
2003
IEEE
15 years 9 months ago
2003
IEEE
Dynamically reconfigurable systems based on partial and dynamically reconfigurable FPGAs may have their functionality partially modified at run-time without stopping the operation...
121
click to vote
SODA
1997
ACM
15 years 5 months ago
1997
ACM
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
177
click to vote
DEXAW
1999
IEEE
1999
IEEE
Using the Distance Distribution for Approximate Similarity Queries in High-Dimensional Metric Spaces
15 years 8 months ago
We investigate the problem of approximate similarity (nearest neighbor) search in high-dimensional metric spaces, and describe how the distance distribution of the query object ca...
147
Voted
SODA
1992
ACM
15 years 5 months ago
1992
ACM
We show that the length of the minimum weight Steiner triangulation (MWST) of a point set can be approximated within a constant factor by a triangulation algorithm based on quadtr...
120
Voted
DEXA
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. In this paper we provide a full-scale evaluation of a cluster-based architecture for P2P IR, focusing on retrieval effectiveness. We observe that there is a significant ...