Sciweavers

380 search results - page 29 / 76
» A Categorical Setting for Lower Complexity
Sort
View
CORR
2012
Springer
249views Education» more  CORR 2012»
13 years 5 months ago
Computing Cartograms with Optimal Complexity
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...
Md. Jawaherul Alam, Therese C. Biedl, Stefan Felsn...
121
Voted
AML
2011
204views Mathematics» more  AML 2011»
14 years 4 months ago
A note on propositional proof complexity of some Ramsey-type statements
Any valid Ramsey statement n −→ (k)2 2 can be encoded into a DNF formula RAM(n, k) of size O(nk) and with terms of size k 2 . Let rk be the minimal n for which the statement h...
Jan Krajícek
SIAMDM
2002
94views more  SIAMDM 2002»
14 years 9 months ago
How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems
A quorum system is a collection of sets (quorums) every two of which intersect. Quorum systems have been used for many applications in the area of distributed systems, including mu...
David Peleg, Avishai Wool
ISCAS
2005
IEEE
209views Hardware» more  ISCAS 2005»
15 years 3 months ago
Low complexity H.263 to H.264 video transcoding using motion vector decomposition
The H.264 adopts various block types and multiple reference frames for motion compensation. For transcoding a video sequence from the H.263 format to the H.264 format, it is benef...
Kai-Tat Fung, Wan-Chi Siu
99
Voted
CORR
2010
Springer
111views Education» more  CORR 2010»
14 years 9 months ago
Improved complexity bounds for real root isolation using Continued Fractions
We consider the problem of isolating the real roots of a square-free polynomial with integer coefficients using (variants of) the continued fraction algorithm (CF). We introduce a...
Elias P. Tsigaridas