2095 search results - page 96 / 419 » Improved pebbling bounds |
COCO
2009
Springer
15 years 7 months ago
2009
Springer
We study the inapproximability of Vertex Cover and Independent Set on degree d graphs. We prove that: • Vertex Cover is Unique Games-hard to approximate to within a factor 2−(...
103
Voted
COMPGEOM
2006
ACM
15 years 6 months ago
2006
ACM
Given a metric space (X, dX), c ≥ 1, r > 0, and p, q ∈ [0, 1], a distribution over mappings H : X → N is called a (r, cr, p, q)-sensitive hash family if any two points in...
110
click to vote
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
This paper analyzes the behavior of the XCS classifier system on imbalanced datasets. We show that XCS with standard parameter settings is quite robust to considerable class imbal...
107
click to vote
IJCAI
2007
15 years 2 months ago
2007
Multiagent distributed resource allocation requires that agents act on limited, localized information with minimum communication overhead in order to optimize the distribution of ...
114
Voted
COMCOM
2008
15 years 25 days ago
2008
In this paper, we present Collaborative Opportunistic Recovery Algorithm (CORA) designed for multicast multimedia applications with low loss as well as latency constraints in ad h...