Sciweavers

534 search results - page 51 / 107
» Efficient polynomial L-approximations
Sort
View
FLAIRS
2008
13 years 10 months ago
On the Compilation of Possibilistic Default Theories
Handling exceptions represents one of the most important problems in Artificial Intelligence. Several approaches have been proposed for reasoning on default theories. This paper f...
Salem Benferhat, Safa Yahi, Habiba Drias
DAGSTUHL
2006
13 years 9 months ago
Computation of the Minimal Associated Primes
Abstract. We propose a new algorithm for the computation of the minimal associated primes of an ideal. In [1] we have introduced modifications to an algorithm for the computation o...
Santiago Laplagne
DAM
2006
86views more  DAM 2006»
13 years 7 months ago
Sub-dominant theory in numerical taxonomy
Sub-dominant theory provides efficient tools for clustering. However it classically works only for ultrametrics and ad hoc extensions like Jardine and Sibson's 2ultrametrics....
François Brucker
PODS
2006
ACM
137views Database» more  PODS 2006»
14 years 8 months ago
Data exchange: computing cores in polynomial time
Data exchange deals with inserting data from one database into another database having a different schema. We study and solve a central computational problem of data exchange, nam...
Georg Gottlob, Alan Nash
SCA
2007
13 years 10 months ago
Legendre fluids: a unified framework for analytic reduced space modeling and rendering of participating media
In this paper, we present a unified framework for reduced space modeling and rendering of dynamic and nonhomogenous participating media, like snow, smoke, dust and fog. The key id...
Mohit Gupta, Srinivasa G. Narasimhan