Sciweavers

470 search results - page 46 / 94
» Local properties of geometric graphs
Sort
View
SASO
2008
IEEE
14 years 2 months ago
Aspects of Distance Sensitive Design of Wireless Sensor Networks
—Distance sensitivity is a locality concept that is useful for designing scalable wireless sensor network applications. In this paper, we formally define distance sensitivity an...
Vinod Kulathumani, Anish Arora
IWCIA
2004
Springer
14 years 1 months ago
Integral Trees: Subtree Depth and Diameter
Regions in an image graph can be described by their spanning tree. A graph pyramid is a stack of image graphs at different granularities. Integral features capture important prope...
Walter G. Kropatsch, Yll Haxhimusa, Zygmunt Pizlo
SIAMJO
2008
66views more  SIAMJO 2008»
13 years 7 months ago
Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization
Recently, a semidefinite programming (SDP) relaxation approach has been proposed to solve the sensor network localization problem. Although it achieves high accuracy in estimating ...
Zizhuo Wang, Song Zheng, Yinyu Ye, Stephen Boyd
CGF
2010
157views more  CGF 2010»
13 years 7 months ago
Binary Shading Using Appearance and Geometry
In the style of binary shading, shape and illumination are depicted using two colors, typically black and white, that form coherent lines and regions in the image. We formulate th...
Bert Buchholz, Tamy Boubekeur, Doug DeCarlo, Marc ...
BC
2005
106views more  BC 2005»
13 years 7 months ago
Phase transitions in the neuropercolation model of neural populations with mixed local and non-local interactions
Abstract We model the dynamical behavior of the neuropil, the densely interconnected neural tissue in the cortex, using neuropercolation approach. Neuropercolation generalizes phas...
Robert Kozma, Marko Puljic, Paul Balister, B&eacut...