Sciweavers

80 search results - page 11 / 16
» The geometry and dynamics of binary trees
Sort
View
IPPS
1997
IEEE
15 years 3 months ago
On the Dynamic Initialization of Parallel Computers
Abstract. The incremental and dynamic construction of interconnection networks from smaller components often leaves the fundamental problem of assigning addresses to processors to ...
Stephan Olariu, Ivan Stojmenovic, Albert Y. Zomaya
CVPR
2007
IEEE
16 years 1 months ago
Learning Visual Similarity Measures for Comparing Never Seen Objects
In this paper we propose and evaluate an algorithm that learns a similarity measure for comparing never seen objects. The measure is learned from pairs of training images labeled ...
Eric Nowak, Frédéric Jurie
TCS
1998
14 years 11 months ago
A Uniform Approach to Semi-Dynamic Problems on Digraphs
In this paper we propose a uniform approach to deal with incremental problems on digraphs and with decremental problems on dags generalizing a technique used by La Poutr´e and va...
Serafino Cicerone, Daniele Frigioni, Umberto Nanni...
ESA
1998
Springer
108views Algorithms» more  ESA 1998»
15 years 3 months ago
Finding an Optimal Path without Growing the Tree
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu
ICC
2007
IEEE
180views Communications» more  ICC 2007»
15 years 6 months ago
Distributed Quad-Tree for Spatial Querying in Wireless Sensor Networks
— In contrast to the traditional wireless sensor network (WSN) applications that perform only data collection and aggregation, new generation of information processing applicatio...
Murat Demirbas, Xuming Lu