Sciweavers

217 search results - page 38 / 44
» A new upper bound on the cyclic chromatic number
Sort
View
JSYML
2008
74views more  JSYML 2008»
14 years 9 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...
TIP
2008
128views more  TIP 2008»
14 years 9 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,...
SIGMOD
2010
ACM
159views Database» more  SIGMOD 2010»
14 years 7 months ago
Histograms reloaded: the merits of bucket diversity
Virtually all histograms store for each bucket the number of distinct values it contains and their average frequency. In this paper, we question this paradigm. We start out by inv...
Carl-Christian Kanne, Guido Moerkotte
INFOCOM
2007
IEEE
15 years 3 months ago
Randomized k-Coverage Algorithms For Dense Sensor Networks
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...
Mohamed Hefeeda, M. Bagheri
OL
2008
79views more  OL 2008»
14 years 9 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