Sciweavers

2342 search results - page 13 / 469
» Sublinear geometric algorithms
Sort
View
DAWAK
2004
Springer
13 years 11 months ago
Space-Efficient Range-Sum Queries in OLAP
Abstract. In this paper, we present a fast algorithm to answer rangesum queries in OLAP data cubes. Our algorithm supports constanttime queries while maintaining sub-linear time up...
Fredrik Bengtsson, Jingsen Chen
ISSAC
1997
Springer
194views Mathematics» more  ISSAC 1997»
13 years 11 months ago
The Minimised Geometric Buchberger Algorithm: An Optimal Algebraic Algorithm for Integer Programming
IP problems characterise combinatorial optimisation problems where conventional numerical methods based on the hill-climbing technique can not be directly applied. Conventional me...
Qiang Li, Yike Guo, Tetsuo Ida, John Darlington
OPODIS
2001
13 years 9 months ago
A Very Fast (Linear Time) Distributed Algorithm, on General Graphs, for the Minimum-Weight Spanning Tree
In their pioneering paper [4], Gallager et al. introduced a distributed algorithm for constructing the minimum-weight spanning tree (MST), many authors have suggested ways to enhan...
Lélia Blin, Franck Butelle
ICALP
2009
Springer
14 years 7 months ago
SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs
Abstract. This paper deals with approximations of maximum independent sets in non-uniform hypergraphs of low degree. We obtain the first performance ratio that is sublinear in term...
Elena Losievskaja, Geir Agnarsson, Magnús M...
APPROX
2006
Springer
120views Algorithms» more  APPROX 2006»
13 years 11 months ago
Approximating Average Parameters of Graphs
Inspired by Feige (36th STOC, 2004), we initiate a study of sublinear randomized algorithms for approximating average parameters of a graph. Specifically, we consider the average ...
Oded Goldreich, Dana Ron