Sciweavers

1017 search results - page 21 / 204
» Some existence and construction results of polygonal designs
Sort
View
MOBIHOC
2008
ACM
14 years 7 months ago
Construction algorithms for k-connected m-dominating sets in wireless sensor networks
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
Yiwei Wu, Yingshu Li
CVPR
2010
IEEE
13 years 7 months ago
Image atlas construction via intrinsic averaging on the manifold of images
In this paper, we propose a novel algorithm for computing an atlas from a collection of images. In the literature, atlases have almost always been computed as some types of means ...
Yuchen Xie, Jeffrey Ho, Baba C. Vemuri
PATMOS
2004
Springer
14 years 22 days ago
An Efficient Low-Degree RMST Algorithm for VLSI/ULSI Physical Design
Motivated by very/ultra large scale integrated circuit (VLSI/ULSI) physical design applications, we study the construction of rectilinear minimum spanning tree (RMST) with its maxi...
Yin Wang, Xianlong Hong, Tong Jing, Yang Yang, Xia...
DIGRA
2005
Springer
14 years 27 days ago
Build It to Understand It: Ludology Meets Narratology in Game Design Space
Building experimental games offers an alternative methodology for researching and understanding games, beyond what can be understood by playing and studying existing games alone. ...
Michael Mateas, Andrew Stern
TON
1998
93views more  TON 1998»
13 years 7 months ago
An evaluation of flow control in group communication
Abstract— Group communication services have been successfully used to construct applications with high availability, dependability, and real-time responsiveness requirements. Flo...
Shivakant Mishra, Lei Wu