83 search results - page 4 / 17 » Extractors: optimal up to constant factors |
SODA
2008
ACM
13 years 9 months ago
2008
ACM
Let H be a finite family of graphs. A graph G is H-universal if it contains a copy of each H H as a subgraph. Let H(k, n) denote the family of graphs on n vertices with maximum d...
ESA
2004
Springer
14 years 26 days ago
2004
Springer
How efficiently can we search an unknown environment for a goal in unknown position? How much would it help if the environment were known? We answer these questions for simple poly...
AUTOMATICA
2008
13 years 7 months ago
2008
: For an infinite-horizon optimal control problem, the cost does not, in general, converge. The classical work-around to this problem is to introduce a discount or "forgetting...
COCO
2006
Springer
13 years 11 months ago
2006
Springer
We consider the problem of finding a monomial (or a term) that maximizes the agreement rate with a given set of examples over the Boolean hypercube. The problem is motivated by le...
FOCS
2008
IEEE
14 years 1 months ago
2008
IEEE
What is the least surface area of a shape that tiles Rd under translations by Zd ? Any such shape must have volume 1 and hence surface area at least that of the volume-1 ball, nam...