Sciweavers

833 search results - page 161 / 167
» Geometric Optimization
Sort
View
INFOCOM
2005
IEEE
14 years 1 months ago
Time and energy complexity of distributed computation in wireless sensor networks
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
Nilesh Khude, Anurag Kumar, Aditya Karnik
GECCO
2005
Springer
125views Optimization» more  GECCO 2005»
14 years 1 months ago
Schema disruption in tree-structured chromosomes
We study if and when the inequality dp(H) ≤ rel∆(H) holds for schemas H in chromosomes that are structured as trees. The disruption probability dp(H) is the probability that a...
William A. Greene
SIGGRAPH
2000
ACM
13 years 12 months ago
Plenoptic sampling
This paper studies the problem of plenoptic sampling in imagebased rendering (IBR). From a spectral analysis of light field signals and using the sampling theorem, we mathematica...
Jinxiang Chai, Shing-Chow Chan, Heung-Yeung Shum, ...
SIGGRAPH
1999
ACM
13 years 11 months ago
A Hierarchical Approach to Interactive Motion Editing for Human-Like Figures
This paper presents a technique for adapting existing motion of a human-like character to have the desired features that are specified by a set of constraints. This problem can b...
Jehee Lee, Sung Yong Shin
IPPS
1999
IEEE
13 years 11 months ago
Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
Frank K. H. A. Dehne, David A. Hutchinson, Anil Ma...