Sciweavers

670 search results - page 58 / 134
» Inclusion-Based Approximate Reasoning
Sort
View
APSEC
2000
IEEE
14 years 5 days ago
A comparative evaluation of techniques for syntactic level source code analysis
Many program maintenance tools rely on traditional parsing techniques to obtain syntactic level models of the code being maintained. When, for some reason, code cannot be parsed, ...
Anthony Cox, Charles L. A. Clarke
COLING
2008
13 years 9 months ago
Exact Inference for Multi-label Classification using Sparse Graphical Models
This paper describes a parameter estimation method for multi-label classification that does not rely on approximate inference. It is known that multi-label classification involvin...
Yusuke Miyao, Jun-ichi Tsujii
OWLED
2008
13 years 9 months ago
Characterizing and Detecting Integrity Issues in OWL Instance Data
We view OWL instance data evaluation as a process in which instance data is checked for conformance with application requirements. We previously identified some integrity issues ra...
Jiao Tao, Li Ding, Jie Bao, Deborah L. McGuinness
IJCAI
1989
13 years 9 months ago
Maximum Entropy in Nilsson's Probabilistic Logic
Nilsson's Probabilistic Logic is a set theoretic mechanism for reasoning with uncertainty. We propose a new way of looking at the probability constraints enforced by the fram...
Thomas B. Kane
CCR
2008
83views more  CCR 2008»
13 years 7 months ago
Stability and fairness of explicit congestion control with small buffers
Rate control protocols that utilise explicit feedback from routers are able to achieve fast convergence to an equilibrium which approximates processor-sharing on a single bottlene...
Frank P. Kelly, Gaurav Raina, Thomas Voice