Sciweavers

973 search results - page 163 / 195
» New Bounds on Crossing Numbers
Sort
View
COMPUTING
2006
100views more  COMPUTING 2006»
13 years 8 months ago
Interval Arithmetic with Containment Sets
The idea of containment sets (csets) is due to Walster and Hansen, and the theory is mainly due to the first author. Now that floating point computation with infinities is widely a...
John D. Pryce, George F. Corliss
JSYML
2008
74views more  JSYML 2008»
13 years 8 months ago
Omitting types for finite variable fragments and complete representations of algebras
. We give a novel application of algebraic logic to first order logic. A new, flexible construction is presented for representable but not completely representable atomic relation ...
Tarek Sayed Ahmed, Hajnal Andréka, Istv&aac...
OL
2008
79views more  OL 2008»
13 years 8 months ago
A simpler and tighter redundant Klee-Minty construction
By introducing redundant Klee-Minty examples, we have previously shown that the central path can be bent along the edges of the Klee-Minty cubes, thus having 2n - 2 sharp turns in...
Eissa Nematollahi, Tamás Terlaky
TALG
2008
124views more  TALG 2008»
13 years 8 months ago
Uniform deterministic dictionaries
Abstract. We present a new analysis of the well-known family of multiplicative hash functions, and improved deterministic algorithms for selecting "good" hash functions. ...
Milan Ruzic
TIP
2008
128views more  TIP 2008»
13 years 8 months ago
Wavelet Frame Accelerated Reduced Support Vector Machines
In this paper, a novel method for reducing the runtime complexity of a support vector machine classifier is presented. The new training algorithm is fast and simple. This is achiev...
Matthias Rätsch, Gerd Teschke, Sami Romdhani,...