Sciweavers

560 search results - page 87 / 112
» Multiplication by a Constant is Sublinear
Sort
View
SIAMSC
2008
151views more  SIAMSC 2008»
14 years 11 months ago
Accurate Floating-Point Summation Part I: Faithful Rounding
Given a vector of floating-point numbers with exact sum s, we present an algorithm for calculating a faithful rounding of s, i.e. the result is one of the immediate floating-point ...
Siegfried M. Rump, Takeshi Ogita, Shin'ichi Oishi
JGT
2007
99views more  JGT 2007»
14 years 11 months ago
Backbone colorings for graphs: Tree and path backbones
We introduce and study backbone colorings, a variation on classical vertex colorings: Given a graph G = (V, E) and a spanning subgraph H of G (the backbone of G), a backbone color...
Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, G...
CORR
2002
Springer
111views Education» more  CORR 2002»
14 years 11 months ago
The Fastest and Shortest Algorithm for All Well-Defined Problems
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
Marcus Hutter
CPC
2002
95views more  CPC 2002»
14 years 11 months ago
Permutation Pseudographs And Contiguity
The space of permutation pseudographs is a probabilistic model of 2-regular pseudographs on n vertices, where a pseudograph is produced by choosing a permutation of {1, 2, . . . ...
Catherine S. Greenhill, Svante Janson, Jeong Han K...
JCT
1998
68views more  JCT 1998»
14 years 11 months ago
Rook Theory and t-Cores
If t is a positive integer, then a partition of a non-negative integer n is a t−core if none of the hook numbers of the associated Ferrers-Young diagram is a multiple of t. These...
James Haglund, Ken Ono, Lawrence Sze