Sciweavers

197 search results - page 33 / 40
» New Upper Bounds for Ramsey Numbers
Sort
View
VLDB
1997
ACM
66views Database» more  VLDB 1997»
14 years 22 hour ago
A One-Pass Algorithm for Accurately Estimating Quantiles for Disk-Resident Data
The cpquantile of an ordered sequenceof data values is the element with rank ‘pn, where n is the total number of values. Accurate estimates of quantiles are required for the sol...
Khaled Alsabti, Sanjay Ranka, Vineet Singh
AHSWN
2008
92views more  AHSWN 2008»
13 years 8 months ago
The (k, l) Coredian Tree for Ad Hoc Networks
In this paper, we present a new efficient strategy for constructing a wireless tree network containing n nodes of diameter while satisfying the QoS requirements such as bandwidth...
Amit Dvir, Michael Segal
JSYML
2008
74views more  JSYML 2008»
13 years 7 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 7 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
TIP
2008
128views more  TIP 2008»
13 years 7 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,...