Sciweavers

4488 search results - page 222 / 898
» Properties of NP-Complete Sets
Sort
View
FOCS
1995
IEEE
15 years 10 months ago
Linear Time Erasure Codes with Nearly Optimal Recovery (Extended Abstract)
d Abstract) Noga Alon ∗ Jeff Edmonds † Michael Luby ‡ An (n, c, , r)-erasure code consists of an encoding algorithm and a decoding algorithm with the following properties. ...
Noga Alon, Jeff Edmonds, Michael Luby
IJIT
2004
15 years 8 months ago
Consistent Hybrid Knowledge Representation in Order-Sorted Logic
Abstract-- We consider a hybrid knowledge representation system for ontological knowledge bases in order to maintain knowledge consistency between taxonomic knowledge and assertion...
Nwe Ni Tun, Satoshi Tojo
CGF
2008
98views more  CGF 2008»
15 years 6 months ago
Surface Reconstruction from Unorganized Point Data with Quadrics
We present a reverse engineering method for constructing a surface approximation scheme whose input is a set of unorganized noisy points in space and whose output is a set of quad...
Marek Vanco, Bernd Hamann, Guido Brunnett
AI
2006
Springer
15 years 6 months ago
Solving logic program conflict through strong and weak forgettings
We consider how to forget a set of atoms in a logic program. Intuitively, when a set of atoms is forgotten from a logic program, all atoms in the set should be eliminated from thi...
Yan Zhang, Norman Y. Foo
TFS
2008
112views more  TFS 2008»
15 years 6 months ago
Gradual Numbers and Their Application to Fuzzy Interval Analysis
Abstract-- We introduce a new way of looking at fuzzy intervals. Instead of considering them as fuzzy sets, we see them as crisp sets of entities we call gradual (real) numbers. Th...
Jérôme Fortin, Didier Dubois, H&eacut...