Sciweavers

451 search results - page 59 / 91
» Some Lower Bounds on Geometric Separability Problems
Sort
View
COCOON
2005
Springer
15 years 3 months ago
Promised and Distributed Quantum Search
This paper gives a quantum algorithm to search in an set S for a k-tuple satisfying some predefined relation, with the promise that some components of a desired k-tuple are in som...
Shengyu Zhang
TSP
2011
106views more  TSP 2011»
14 years 4 months ago
Distributed Estimation and Coding: A Sequential Framework Based on a Side-Informed Decomposition
Abstract—We propose a sequential framework for the distributed multiple-sensor estimation and coding problem that decomposes the problem into a series of side-informed source cod...
Chao Yu, Gaurav Sharma
76
Voted
ICC
2008
IEEE
127views Communications» more  ICC 2008»
15 years 4 months ago
On the Devolution of Large-Scale Sensor Networks in the Presence of Random Failures
—In battery-constrained large-scale sensor networks, nodes are prone to random failures due to various reasons, such as energy depletion and hostile environment. Random failures ...
Fei Xing, Wenye Wang
COMBINATORICS
2000
63views more  COMBINATORICS 2000»
14 years 9 months ago
A Ramsey Treatment of Symmetry
Given a space endowed with symmetry, we define ms(, r) to be the maximum of m such that for any r-coloring of there exists a monochromatic symmetric set of size at least m. We c...
Taras O. Banakh, O. V. Verbitsky, Ya. Vorobets
AIEDAM
2008
127views more  AIEDAM 2008»
14 years 9 months ago
Evolving blackbox quantum algorithms using genetic programming
Although it is known that quantum computers can solve certain computational problems exponentially faster than classical computers, only a small number of quantum algorithms have ...
Ralf Stadelhofer, Wolfgang Banzhaf, Dieter Suter