Sciweavers

9405 search results - page 259 / 1881
» Computing a Model of Set Theory
Sort
View
AI
2006
Springer
15 years 4 months ago
Ranking functions and rankings on languages
The Spohnian paradigm of ranking functions is in many respects like an order-of-magnitude reverse of subjective probability theory. Unlike probabilities, however, ranking function...
Franz Huber
RSEISP
2007
Springer
15 years 10 months ago
Interpreting Low and High Order Rules: A Granular Computing Approach
The main objective of this paper is to provide a granular computing based interpretation of rules representing two levels of knowledge. This is done by adopting and adapting the de...
Yiyu Yao, Bing Zhou, Yaohua Chen
ICPR
2010
IEEE
15 years 3 months ago
A Conductance Electrical Model for Representing and Matching Weighted Undirected Graphs
In this paper we propose a conductance electrical model to represent weighted undirected graphs that allows us to efficiently compute approximate graph isomorphism in large graph...
Manuel Igelmo, Alberto Sanfeliu, Miquel Ferrer
COMPUTER
2002
103views more  COMPUTER 2002»
15 years 4 months ago
SimpleScalar: An Infrastructure for Computer System Modeling
tail defines the level of abstraction used to implement the model's components. A highly detailed model will faithfully simulate all aspects of machine operation, whether or n...
Todd M. Austin, Eric Larson, Dan Ernst
SIGGRAPH
1997
ACM
15 years 8 months ago
Guaranteeing the topology of an implicit surface polygonization for interactive modeling
Morse theory shows how the topology of an implicit surface is affected by its function’s critical points, whereas catastrophe theory shows how these critical points behave as th...
Barton T. Stander, John C. Hart