Sciweavers

2569 search results - page 478 / 514
» Approximate Objects and Approximate Theories
Sort
View
FOCS
2000
IEEE
15 years 4 months ago
Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation
In this article, we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: —We show that, for a...
Piotr Indyk
STOC
2000
ACM
156views Algorithms» more  STOC 2000»
15 years 4 months ago
Near optimal multiple alignment within a band in polynomial time
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
Ming Li, Bin Ma, Lusheng Wang
COMPGEOM
2007
ACM
15 years 3 months ago
Kinetic KD-trees and longest-side KD-trees
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...
Mohammad Ali Abam, Mark de Berg, Bettina Speckmann
ICASSP
2009
IEEE
15 years 3 months ago
Optimized opportunistic multicast scheduling (OMS) over heterogeneous cellular networks
Optimized opportunistic multicast scheduling (OMS) has been studied previously by the authors for homogeneous cellular networks, where the problem of efficiently transmitting a co...
Tze-Ping Low, Man-On Pun, Yao-Win Peter Hong, C.-C...
CCS
2006
ACM
15 years 3 months ago
Secure function evaluation with ordered binary decision diagrams
Privacy-preserving protocols allow multiple parties with private inputs to perform joint computation while preserving the privacy of their respective inputs. An important cryptogr...
Louis Kruger, Somesh Jha, Eu-Jin Goh, Dan Boneh