Sciweavers

279 search results - page 36 / 56
» Matching Polynomials And Duality
Sort
View
TIME
2009
IEEE
14 years 2 months ago
Strong Temporal, Weak Spatial Logic for Rule Based Filters
—Rule-based filters are sequences of rules formed of a condition and a decision. Rules are applied sequentially up to the first fulfilled condition, whose matching decision de...
Roger Villemaire, Sylvain Hallé
STACS
2007
Springer
14 years 1 months ago
Compact Forbidden-Set Routing
We study the following problem. Given a weighted planar graph G, assign labels L(v) to vertices so that given L(u), L(v) and L(x) for x ∈ X for any X ⊂ V (G), compute the dist...
Bruno Courcelle, Andrew Twigg
ICMCS
2005
IEEE
109views Multimedia» more  ICMCS 2005»
14 years 1 months ago
Spatial Error Concealment Based on Bezier Curves
This paper presents a geometric error concealment scheme for DCT-based image/video data based on the Bezier polynomials (BP). The proposed scheme makes use of the average edge dir...
Rogelio Hasimoto-Beltran, Ashfaq A. Khokhar
COCOON
2005
Springer
14 years 1 months ago
Interference in Cellular Networks: The Minimum Membership Set Cover Problem
Abstract. The infrastructure for mobile distributed tasks is often formed by cellular networks. One of the major issues in such networks is interference. In this paper we tackle in...
Fabian Kuhn, Pascal von Rickenbach, Roger Wattenho...
PDCAT
2005
Springer
14 years 1 months ago
Approximating Spanning Trees with Inner Nodes Cost
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
Rudolf Fleischer, Qi Ge, Jian Li, Shijun Tian, Hai...