1763 search results - page 317 / 353 » Dependent random choice |
137
click to vote
APPROX
2009
Springer
15 years 10 months ago
2009
Springer
We study the maximization version of the fundamental graph coloring problem. Here the goal is to color the vertices of a k-colorable graph with k colors so that a maximum fraction ...
105
click to vote
CRYPTO
2009
Springer
15 years 10 months ago
2009
Springer
In the Hidden Number Problem (HNP), the goal is to find a hidden number s, when given p, g and access to an oracle that on query a returns the k most significant bits of s · ga ...
164
click to vote
SIGMETRICS
2009
ACM
15 years 10 months ago
2009
ACM
Disseminating a piece of information, or updates for a piece of information, has been shown to benefit greatly from simple randomized procedures, sometimes referred to as gossipi...
155
click to vote
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...
133
click to vote
CIVR
2007
Springer
15 years 10 months ago
2007
Springer
We present a novel matching and similarity evaluation method for planar geometric shapes represented by sets of polygonal curves. Given two shapes, the matching algorithm randomly...