Sciweavers

438 search results - page 26 / 88
» A Theory of Competitive Analysis for Distributed Algorithms
Sort
View
FOCS
2000
IEEE
13 years 11 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
PODC
2010
ACM
13 years 11 months ago
Brief announcement: complexity and solution of the send-receive correlation problem
During the analysis of packet log files from network experiments, the question arises which received packet belongs to which of the potentially many binary identical send events....
Benito van der Zander, Egon Wanke, Wolfgang Kie&sz...
COMPGEOM
2003
ACM
14 years 20 days ago
Molecular shape analysis based upon the morse-smale complex and the connolly function
Docking is the process by which two or several molecules form a complex. Docking involves the geometry of the molecular surfaces, as well as chemical and energetical consideration...
Frédéric Cazals, Frédé...
ESA
2006
Springer
140views Algorithms» more  ESA 2006»
13 years 11 months ago
Latency Constrained Aggregation in Sensor Networks
A sensor network consists of sensing devices which may exchange data through wireless communication. A particular feature of sensor networks is that they are highly energy constrai...
Luca Becchetti, Peter Korteweg, Alberto Marchetti-...
TEC
2012
234views Formal Methods» more  TEC 2012»
11 years 9 months ago
Cooperatively Coevolving Particle Swarms for Large Scale Optimization
—This paper presents a new cooperative coevolving particle swarm optimization (CCPSO) algorithm in an attempt to address the issue of scaling up particle swarm optimization (PSO)...
Xiaodong Li, Xin Yao