2430 search results - page 262 / 486 » Computing Tutte Polynomials |
114
click to vote
IPL
2007
15 years 4 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 ...
131
click to vote
ICDT
2010
ACM
15 years 3 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...
144
click to vote
CORR
2011
Springer
14 years 7 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...
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 ...
123
click to vote
CVPR
2007
IEEE
16 years 6 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...