1484 search results - page 165 / 297 » Ants meeting algorithms |
93
Voted
SDMW
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. In this paper, we address the problem of protecting the underlying attribute values when sharing data for clustering. The challenge is how to meet privacy requirements an...
89
Voted
WAOA
2004
Springer
15 years 3 months ago
2004
Springer
We provide a new technique to derive group strategyproof mechanisms for the cost-sharing problem. Our technique is simpler and provably more powerful than the existing one based on...
ITC
2003
IEEE
15 years 3 months ago
2003
IEEE
Today’s ASIC designs consist of more memory in terms of both area and number of instances. The shrinking of geometries has an even greater effect upon memories due to their tigh...
ILP
2003
Springer
15 years 3 months ago
2003
Springer
Query optimization is used frequently in relational database management systems. Most existing techniques are based on reordering the relational operators, where the most selective...
COMPGEOM
2010
ACM
15 years 3 months ago
2010
ACM
Let B be a collection of n arbitrary balls in R3 . We establish an almost-tight upper bound of O(n3+ε ), for any ε > 0, on the complexity of the space F(B) of all the lines t...