Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
JCSS
2011
95views more  JCSS 2011»
11 years 9 days ago
Hardness results for approximating the bandwidth
The bandwidth of an n-vertex graph G is the minimum value b such that the vertices of G can be mapped to distinct integer points on a line without any edge being stretched to a di...
Chandan K. Dubey, Uriel Feige, Walter Unger
EUSFLAT
2009
173views Fuzzy Logic» more  EUSFLAT 2009»
11 years 3 months ago
Application of Zadeh's Impossibility Principle to Approximate Explanation
Abstract: We consider application of Zadeh's impossibility principle and extended logic FLe to approximate scientific explanation from the standpoint of the philosophy of scie...
Vesa A. Niskanen
CORR
2010
Springer
84views Education» more  CORR 2010»
11 years 5 months ago
Improved Inapproximability For Submodular Maximization
We show that it is Unique Games-hard to approximate the maximum of a submodular function to within a factor 0.695, and that it is Unique Games-hard to approximate the maximum of a ...
Per Austrin
JMLR
2006
91views more  JMLR 2006»
11 years 5 months ago
QP Algorithms with Guaranteed Accuracy and Run Time for Support Vector Machines
We describe polynomial
Don R. Hush, Patrick Kelly, Clint Scovel, Ingo Ste...
FUIN
2006
98views more  FUIN 2006»
11 years 5 months ago
On-line Approximate String Matching in Natural Language
We consider approximate pattern matching in natural language text. We use the words of the text as the alphabet, instead of the characters as in traditional string matching approac...
Kimmo Fredriksson
CORR
2010
Springer
170views Education» more  CORR 2010»
11 years 5 months ago
Global Optimization for Value Function Approximation
Existing value function approximation methods have been successfully used in many applications, but they often lack useful a priori error bounds. We propose a new approximate bili...
Marek Petrik, Shlomo Zilberstein
ECAI
2008
Springer
11 years 7 months ago
An Analysis of Bayesian Network Model-Approximation Techniques
Abstract. Two approaches have been used to perform approximate inference in Bayesian networks for which exact inference is infeasible: employing an approximation algorithm, or appr...
Adamo Santana, Gregory M. Provan
AAAI
2007
11 years 7 months ago
Partial Matchmaking using Approximate Subsumption
Description Logics, and in particular the web ontology language OWL has been proposed as an appropriate basis for computing matches between structured objects for the sake of info...
Heiner Stuckenschmidt
AIIA
1991
Springer
11 years 9 months ago
Approximate Entailment
The use of approximation as a method for dealing with complex problems is a fundamental research issue in Knowledge Representation. Using approximation in symbolic AI is not strai...
Marco Cadoli, Marco Schaerf
KR
2000
Springer
11 years 9 months ago
Anytime Diagnostic Reasoning using Approximate Boolean Constraint Propagation
In contrast with classical reasoning, where a solution is either correct or incorrect, approximate reasoning tries to compute solutions which are close to the ideal solution, with...
Alan Verberne, Frank van Harmelen, Annette ten Tei...
books