Sciweavers

6045 search results - page 203 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
DCC
1999
IEEE
14 years 17 days ago
Edge Adaptive Prediction for Lossless Image Coding
We design an edge adaptive predictor for lossless image coding. The predictor adaptively weights four directional predictor together with an adaptive linear predictor based on inf...
Wee Sun Lee
IPPS
1999
IEEE
14 years 16 days ago
PARADIGM (version 2.0): A New HPF Compilation System
In this paper,a we present sample performance figures for a new linear algebra-based compilation framework implemented in a research HPF compiler called PARADIGM. The metrics cons...
Pramod G. Joisha, Prithviraj Banerjee
AAECC
1998
Springer
88views Algorithms» more  AAECC 1998»
13 years 8 months ago
A Generalization of the Massey-Ding Algorithm
The set of all linear recurrence relations satisfied by given sequences of finite length is described by the annihilator ideal of the sequences. The MasseyDing algorithm to compu...
Joachim Althaler, Arne Dür
ORL
2010
76views more  ORL 2010»
13 years 6 months ago
Small bipartite subgraph polytopes
We compute a complete linear description of the bipartite subgraph polytope, for up to seven nodes, and a conjectured complete description for eight nodes. We then show how these ...
Laura Galli, Adam N. Letchford
FOCS
2010
IEEE
13 years 6 months ago
A Non-linear Lower Bound for Planar Epsilon-Nets
We show that the minimum possible size of an -net for point objects and line (or rectangle)ranges in the plane is (slightly) bigger than linear in 1/ . This settles a problem rais...
Noga Alon