Sciweavers

2223 search results - page 262 / 445
» Ontological Framework for Approximation
Sort
View
CJ
1998
118views more  CJ 1998»
15 years 4 months ago
Least-Squares Structuring, Clustering and Data Processing Issues
Approximation structuring clustering is an extension of what is usually called square-error clustering" onto various cluster structures and data formats. It appears to be not...
Boris Mirkin
131
Voted
LOGCOM
2010
104views more  LOGCOM 2010»
15 years 3 months ago
Herbrand's Theorem, Skolemization and Proof Systems for First-Order Lukasiewicz Logic
Abstract. An approximate Herbrand theorem is established for firstorder infinite-valued Lukasiewicz Logic and used to obtain a proof-theoretic proof of Skolemization. These resul...
Matthias Baaz, George Metcalfe
135
Voted
TCS
2010
15 years 3 months ago
Randomized priority algorithms
Borodin, Nielsen and Rackoff [13] introduced the class of priority algorithms as a framework for modeling deterministic greedy-like algorithms. In this paper we address the effe...
Spyros Angelopoulos, Allan Borodin
CORR
2000
Springer
144views Education» more  CORR 2000»
15 years 4 months ago
Sequence-Based Abstract Interpretation of Prolog
-BASED ABSTRACT INTERPRETATION OF PROLOG1 BAUDOUIN LE CHARLIER, SABINA ROSSI, AND PASCAL VAN HENTENRYCK . Abstract interpretation is a general methodology for systematic developmen...
Baudouin Le Charlier, Sabina Rossi, Pascal Van Hen...
WWW
2005
ACM
16 years 5 months ago
The semantic webscape: a view of the semantic web
It has been a few years since the semantic Web was initiated by W3C, but its status has not been quantitatively measured. It is crucial to understand the status at this early stag...
Juhnyoung Lee, Richard Goodwin