Sciweavers

2430 search results - page 104 / 486
» Computing Tutte Polynomials
Sort
View
ISSAC
2001
Springer
123views Mathematics» more  ISSAC 2001»
15 years 9 months ago
A probabilistic algorithm to test local algebraic observability in polynomial time
The following questions are often encountered in system and control theory. Given an algebraic model of a physical process, which variables can be, in theory, deduced from the inp...
Alexandre Sedoglavic
FUIN
2002
76views more  FUIN 2002»
15 years 4 months ago
Making revision reversible: an approach based on polynomials
This paper deals with iterated belief change and proposes a drastic revision rule that modifies a plausibility ordering of interpretations in such a way that any world where the in...
Salem Benferhat, Didier Dubois, Sylvain Lagrue, Od...
142
Voted
CORR
2008
Springer
116views Education» more  CORR 2008»
15 years 4 months ago
Polynomial Filtering for Fast Convergence in Distributed Consensus
Abstract--In the past few years, the problem of distributed consensus has received a lot of attention, particularly in the framework of ad hoc sensor networks. Most methods propose...
Effrosini Kokiopoulou, Pascal Frossard
152
Voted
JCO
2010
182views more  JCO 2010»
15 years 3 months ago
Polynomial time approximation schemes for minimum disk cover problems
The following planar minimum disk cover problem is considered in this paper: given a set D of n disks and a set P of m points in the Euclidean plane, where each disk covers a subse...
Chen Liao, Shiyan Hu
TIM
2010
144views Education» more  TIM 2010»
14 years 11 months ago
Extending Polynomial Chaos to Include Interval Analysis
Polynomial chaos theory (PCT) has been proven to be an efficient and effective way to represent and propagate uncertainty through system models and algorithms in general. In partic...
Antonello Monti, Ferdinanda Ponci, Marco Valtorta