Sciweavers

2767 search results - page 190 / 554
» Universal Exponentiation Algorithm
Sort
View
100
Voted
IANDC
2008
116views more  IANDC 2008»
15 years 2 months ago
Deciding expressive description logics in the framework of resolution
We present a decision procedure for the description logic SHIQ based on the basic superposition calculus, and show that it runs in exponential time for unary coding of numbers. To...
Ullrich Hustadt, Boris Motik, Ulrike Sattler
125
Voted
CPC
2007
101views more  CPC 2007»
15 years 2 months ago
Colouring Random 4-Regular Graphs
We show that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. The proof uses an efficient algorithm which a.a.s. 3colours a random 4-regular ...
Lingsheng Shi, Nicholas C. Wormald
99
Voted
SIAMJO
2008
93views more  SIAMJO 2008»
15 years 2 months ago
Smooth Optimization with Approximate Gradient
We show that the optimal complexity of Nesterov's smooth first-order optimization algorithm is preserved when the gradient is only computed up to a small, uniformly bounded er...
Alexandre d'Aspremont
SIAMSC
2008
111views more  SIAMSC 2008»
15 years 2 months ago
Revisiting the Crowding Phenomenon in Schwarz-Christoffel Mapping
We address the problem of conformally mapping the unit disk to polygons with elongations. The elongations cause the derivative of the conformal map to be exponentially large in so...
L. Banjai
JMLR
2010
99views more  JMLR 2010»
14 years 9 months ago
An Efficient Explanation of Individual Classifications using Game Theory
We present a general method for explaining individual predictions of classification models. The method is based on fundamental concepts from coalitional game theory and prediction...
Erik Strumbelj, Igor Kononenko