Sciweavers

2767 search results - page 421 / 554
» Universal Exponentiation Algorithm
Sort
View
STOC
2005
ACM
184views Algorithms» more  STOC 2005»
14 years 2 months ago
Coresets in dynamic geometric data streams
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
Gereon Frahling, Christian Sohler
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
14 years 9 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
ICANNGA
2007
Springer
191views Algorithms» more  ICANNGA 2007»
14 years 3 months ago
Novel Multi-layer Non-negative Tensor Factorization with Sparsity Constraints
In this paper we present a new method of 3D non-negative tensor factorization (NTF) that is robust in the presence of noise and has many potential applications, including multi-way...
Andrzej Cichocki, Rafal Zdunek, Seungjin Choi, Rob...
ALT
1999
Springer
14 years 1 months ago
PAC Learning with Nasty Noise
We introduce a new model for learning in the presence of noise, which we call the Nasty Noise model. This model generalizes previously considered models of learning with noise. Th...
Nader H. Bshouty, Nadav Eiron, Eyal Kushilevitz
COMPGEOM
1992
ACM
14 years 1 months ago
On-Line Steiner Trees in the Euclidean Plane
Suppose we are given a sequence of n points in the Euclidean plane, and our objective is to construct, on-line, a connected graph that connects all of them, trying to minimize the...
Noga Alon, Yossi Azar