Sciweavers

793 search results - page 27 / 159
» Efficient computation of the characteristic polynomial
Sort
View
DLT
2008
13 years 9 months ago
Derivation Tree Analysis for Accelerated Fixed-Point Computation
We show that for several classes of idempotent semirings the least fixed-point of a polynomial system of equations X = f(X) is equal to the least fixed-point of a linear system obt...
Javier Esparza, Stefan Kiefer, Michael Luttenberge...
PODS
2003
ACM
158views Database» more  PODS 2003»
14 years 7 months ago
Computing full disjunctions
Full disjunctions are an associative extension of the outerjoin operator to an arbitrary number of relations. Their main advantage is the ability to maximally combine data from di...
Yaron Kanza, Yehoshua Sagiv
FUIN
2002
76views more  FUIN 2002»
13 years 7 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...
CORR
2008
Springer
116views Education» more  CORR 2008»
13 years 7 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
ICCS
2004
Springer
14 years 29 days ago
DisCAS: A Distributed-Parallel Computer Algebra System
The DisCAS system employs and interacts with multiple ELIMINOs distributed over the Internet to achieve a distributed-parallel computing environment. ELIMINO is a computer algebra ...
Yongwei Wu, Guangwen Yang, Weimin Zheng, Dongdai L...