2600 search results - page 252 / 520 » Clustering with or without the Approximation |
192
click to vote
SPAA
2004
ACM
16 years 1 days ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
177
click to vote
SIGECOM
2008
ACM
15 years 6 months ago
2008
ACM
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
314
click to vote
ICDT
2009
ACM
16 years 7 months ago
2009
ACM
A technique called user views has recently been proposed to focus user attention on relevant information in response to provenance queries over workflow executions [1, 2]: Given u...
261
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
Database queries are often exploratory and users often find their queries return too many answers, many of them irrelevant. Existing work either categorizes or ranks the results t...
170
click to vote
MOBIHOC
2005
ACM
16 years 6 months ago
2005
ACM
This paper proposes a location service to assist location-based routing protocols, realized through a novel Associativity-Based clustering protocol. The main goal of our scheme, w...