Sciweavers

338 search results - page 21 / 68
» Fast distributed random walks
Sort
View
67
Voted
TIT
2008
103views more  TIT 2008»
14 years 9 months ago
Fast Distributed Algorithms for Computing Separable Functions
The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on loc...
Damon Mosk-Aoyama, Devavrat Shah
PPSN
2000
Springer
15 years 1 months ago
Genetic Programming Bloat without Semantics
To investigate the fundamental causes of bloat, six artificial random binary tree search spaces are presented. Fitness is given by program syntax (the genetic programming genotype)...
William B. Langdon, Wolfgang Banzhaf
ACSAC
2010
IEEE
14 years 7 months ago
Fast and practical instruction-set randomization for commodity systems
Instruction-set randomization (ISR) is a technique based on randomizing the "language" understood by a system to protect it from code-injection attacks. Such attacks wer...
Georgios Portokalidis, Angelos D. Keromytis
158
Voted
SIGMOD
2006
ACM
116views Database» more  SIGMOD 2006»
15 years 9 months ago
Fast range-summable random variables for efficient aggregate estimation
Exact computation for aggregate queries usually requires large amounts of memory ? constrained in data-streaming ? or communication ? constrained in distributed computation ? and ...
Florin Rusu, Alin Dobra
ICRA
2010
IEEE
193views Robotics» more  ICRA 2010»
14 years 8 months ago
Model-based motion tracking system using distributed network cameras
— For a coexisting and collaborative society that incorporates humans and robots, the detection, tracking, and recognition of human motion are indispensable techniques for a robo...
Yumi Iwashita, Ryo Kurazume, Takamitsu Mori, Masak...