Sciweavers

MOC
2016
8 years 8 months ago
Weak convergence for a spatial approximation of the nonlinear stochastic heat equation
We find the weak rate of convergence of the spatially semidiscrete finite element approximation of the nonlinear stochastic heat equation. Both multiplicative and additive noise ...
Adam Andersson, Stig Larsson
MOC
2016
8 years 8 months ago
Approximate solutions of generalized Riemann problems for nonlinear systems of hyperbolic conservation laws
We study analytical properties of the Toro-Titarev solver for generalized Riemann problems (GRPs), which is the heart of the flux computation in ADER generalized Godunov schemes. ...
Claus R. Goetz, Armin Iske
MOC
2016
8 years 8 months ago
Better polynomials for GNFS
Abstract. The general number field sieve (GNFS) is the most efficient algorithm known for factoring large integers. It consists of several stages, the first one being polynomial ...
Shi Bai, Cyril Bouvier, Alexander Kruppa, Paul Zim...
MOC
2016
8 years 8 months ago
Zeros of Dedekind zeta functions under GRH
Assuming GRH, we prove an explicit upper bound for the number of zeros of a Dedekind zeta function having imaginary part in [T−a, T+a]. We also prove a bound for the multiplicity...
Loïc Grenié, Giuseppe Molteni
MMS
2016
8 years 8 months ago
Online web video topic detection and tracking with semi-supervised learning
With the pervasiveness of online social media and rapid growth of web data, a large amount of multimedia data is available online. However, how to organize them for facilitating us...
Guorong Li, Shuqiang Jiang, Weigang Zhang, Junbiao...
LATIN
2016
Springer
8 years 8 months ago
Graph Drawings with One Bend and Few Slopes
We consider drawings of graphs in the plane in which edges are represented by polygonal paths with at most one bend and the number of different slopes used by all segments of thes...
Kolja Knauer, Bartosz Walczak
LATIN
2016
Springer
8 years 8 months ago
Tree Compression Using String Grammars
We study the compressed representation of a ranked tree by a straight-line program (SLP) for its preorder traversal string, and compare it with the previously studied representatio...
Moses Ganardi, Danny Hucke, Markus Lohrey, Eric No...
LATIN
2016
Springer
8 years 8 months ago
Faster Information Gathering in Ad-Hoc Radio Tree Networks
We study information gathering in ad-hoc radio networks. Initially, each node of the network has a piece of information called a rumor, and the overall objective is to gather all t...
Marek Chrobak, Kevin P. Costello
LATIN
2016
Springer
8 years 8 months ago
Generating Random Spanning Trees via Fast Matrix Multiplication
We consider the problem of sampling a uniformly random spanning tree of a graph. This is a classic algorithmic problem for which several exact and approximate algorithms are known....
Nicholas J. A. Harvey, Keyulu Xu