Search Sciweavers | Sciweavers

2 search results - page 1 / 1

» Almost Tight Upper Bound for Finding Fourier Coefficients of...

click to vote

COLT
2008
Springer

213views Machine Learning» more COLT 2008»

Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions

13 years 1 months ago

Download colt2008.cs.helsinki.fi

A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...

Sung-Soon Choi, Kyomin Jung, Jeong Han Kim

claim paper

Read More »

click to vote

AI
2010
Springer

168views Artificial Intelligence» more AI 2010»

Optimal query complexity bounds for finding graphs

12 years 11 months ago

Download www.cs.ust.hk

We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...

Sung-Soon Choi, Jeong Han Kim

claim paper

Read More »

« Prev « First page 1 / 1 Last » Next »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers