Sciweavers

199 search results - page 18 / 40
» Denotations for Classical Proofs - Preliminary Results
Sort
View
JANCL
2002
77views more  JANCL 2002»
13 years 7 months ago
Axiomatizing Distance Logics
In [8, 6] we introduced a family of `modal' languages intended for talking about distances. These languages are interpreted in `distance spaces' which satisfy some (or a...
Oliver Kutz, Holger Sturm, Nobu-Yuki Suzuki, Frank...
COCOON
2007
Springer
14 years 1 months ago
On the Hardness of Optimization in Power Law Graphs
Our motivation for this work is the remarkable discovery that many large-scale real-world graphs ranging from Internet and World Wide Web to social and biological networks exhibit ...
Alessandro Ferrante, Gopal Pandurangan, Kihong Par...
IJCAI
2003
13 years 9 months ago
AUC: a Statistically Consistent and more Discriminating Measure than Accuracy
Predictive accuracy has been used as the main and often only evaluation criterion for the predictive performance of classification learning algorithms. In recent years, the area ...
Charles X. Ling, Jin Huang, Harry Zhang
AML
2002
70views more  AML 2002»
13 years 7 months ago
On the formal points of the formal topology of the binary tree
Abstract Formal topology is today an established topic in the development of constructive mathematics and constructive proofs for many classical results of general topology have be...
Silvio Valentini
JSC
2007
79views more  JSC 2007»
13 years 7 months ago
Computation of bases of free modules over the Weyl algebras
A well-known result due to J. T. Stafford asserts that a stably free left module M over the Weyl algebras D = An(k) or Bn(k) − where k is a field of characteristic 0 − with ...
Alban Quadrat, Daniel Robertz