2430 search results - page 262 / 486 » Computing Tutte Polynomials |
171
Voted
IPL
2007
15 years 7 months ago
2007
We prove that there is a polynomial time substitution (y1, . . . , yn) := g(x1, . . . , xk) with k << n such that whenever the substitution instance A(g(x1, . . . , xk)) of ...
183
Voted
ICDT
2010
ACM
15 years 6 months ago
2010
ACM
We propose a greedy algorithm which, given a hypergraph H and a positive integer k, produces a hypertree decomposition of width less than or equal to 3k −1, or determines that H...
218
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
In studying how to communicate over a public channel with an active adversary, Dodis and Wichs introduced the notion of a non-malleable extractor. A non-malleable extractor dramat...
216
Voted
FOCS
2008
IEEE
16 years 1 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 ...
180
Voted
CVPR
2007
IEEE
16 years 9 months ago
2007
IEEE
Given five motion vectors observed in a calibrated camera, what is the rotational and translational velocity of the camera? This problem is the infinitesimal motion analogue to th...