Sciweavers

336 search results - page 27 / 68
» Effective Randomness for Computable Probability Measures
Sort
View
JIRS
2007
108views more  JIRS 2007»
13 years 7 months ago
GODZILA: A Low-resource Algorithm for Path Planning in Unknown Environments
— In this paper, we propose a novel path-planning and obstacle avoidance algorithm GODZILA for navigation in unknown environments. No prior knowledge of the environment is requir...
Prashanth Krishnamurthy, Farshad Khorrami
TMI
2008
92views more  TMI 2008»
13 years 7 months ago
Using Perturbation Theory to Compute the Morphological Similarity of Diffusion Tensors
Computing the morphological similarity of diffusion tensors (DTs) at neighboring voxels within a DT image, or at corresponding locations across different DT images, is a fundamenta...
Ravi Bansal, Lawrence H. Staib, Dongrong Xu, Andre...
EDBT
2010
ACM
246views Database» more  EDBT 2010»
14 years 2 months ago
Fast computation of SimRank for static and dynamic information networks
Information networks are ubiquitous in many applications and analysis on such networks has attracted significant attention in the academic communities. One of the most important ...
Cuiping Li, Jiawei Han, Guoming He, Xin Jin, Yizho...
SAC
2008
ACM
13 years 7 months ago
Error estimation in wireless sensor networks
We present an analogy between the operation of a Wireless Sensor Network and the sampling and reconstruction of a signal. We measure the impact of three factors on the quality of ...
Alejandro César Frery, Heitor Ramos, Jos&ea...
MOBIHOC
2002
ACM
14 years 7 months ago
Characterizing the interaction between routing and MAC protocols in ad-hoc networks
We empirically study the effect of mobility and interaction between various input parameters on the performance of protocols designed for wireless ad-hoc networks. An important ob...
Christopher L. Barrett, Achla Marathe, Madhav V. M...