Sciweavers

9405 search results - page 337 / 1881
» Computing a Model of Set Theory
Sort
View
AI
2006
Springer
15 years 5 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
ICALT
2006
IEEE
15 years 11 months ago
Effective Analysis and Design of Computer-Supported Learning System
The analysis phase constitutes an essential step in the development of information systems. Nevertheless, learning materials design activities currently have reduced the analysis ...
David Díez Cebollero, Camino Fernánd...
CN
2000
92views more  CN 2000»
15 years 4 months ago
What is this page known for? Computing Web page reputations
The textual content of the Web enriched with the hyperlink structure surrounding it can be a useful source of information for querying and searching. This paper presents a search ...
Davood Rafiei, Alberto O. Mendelzon
174
Voted
ICASSP
2010
IEEE
15 years 5 months ago
Hierarchical dictionary learning for invariant classification
Sparse representation theory has been increasingly used in the fields of signal processing and machine learning. The standard sparse models are not invariant to spatial transform...
Leah Bar, Guillermo Sapiro
SMA
2003
ACM
132views Solid Modeling» more  SMA 2003»
15 years 10 months ago
Tight cocone: a water-tight surface reconstructor
Surface reconstruction from unorganized sample points is an important problem in computer graphics, computer aided design, medical imaging and solid modeling. Recently a few algor...
Tamal K. Dey, Samrat Goswami