Sciweavers

5 search results - page 1 / 1
» Computable shuffle sums of ordinals
Sort
View
RTA
1997
Springer
13 years 10 months ago
A Complete Axiomatisation for the Inclusion of Series-Parallel Partial Orders
Series-parallel orders are de ned as the least class of partial orders containing the one-element order and closed by ordinal sum and disjoint union. From this inductive de nition,...
Denis Béchet, Philippe de Groote, Christian...
FCT
2007
Springer
14 years 15 days ago
On the Topological Complexity of Weakly Recognizable Tree Languages
We show that the family of tree languages recognized by weak alternating automata is closed by three set theoretic operations that correspond to sum, multiplication by ordinals <...
Jacques Duparc, Filip Murlak
ASAP
2003
IEEE
113views Hardware» more  ASAP 2003»
13 years 11 months ago
A VLSI Architecture for Advanced Video Coding Motion Estimation
With the advent of new video standards such as MPEG-4 part-10 and H.264/H.26L, demands for advanced video coding (AVC), particularly in area of variable block searching motion est...
Swee Yeow, John V. McCanny
SAGT
2009
Springer
113views Game Theory» more  SAGT 2009»
14 years 26 days ago
Games with Congestion-Averse Utilities
Congestion games—in which players strategically choose from a set of “resources” and derive utilities that depend on the congestion on each resource— are important in a wid...
Andrew Byde, Maria Polukarov, Nicholas R. Jennings