Sciweavers

713 search results - page 92 / 143
» Laplacian mesh optimization
Sort
View
SPAA
1999
ACM
13 years 12 months ago
Time-Constrained Scheduling of Weighted Packets on Trees and Meshes
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
Micah Adler, Sanjeev Khanna, Rajmohan Rajaraman, A...
TWC
2008
154views more  TWC 2008»
13 years 7 months ago
TUA: A Novel Compromise-Resilient Authentication Architecture for Wireless Mesh Networks
User authentication is essential in service-oriented communication networks to identify and reject any unauthorized network access. The state-of-the-art practice in securing wirele...
Xiaodong Lin, Rongxing Lu, Pin-Han Ho, Xuemin Shen...
MP
2010
119views more  MP 2010»
13 years 6 months ago
Efficient and fair routing for mesh networks
Inspired by the One Laptop Per Child project, we consider mesh networks that connect devices that cannot recharge their batteries easily. We study how the mesh should retransmit in...
Andrea Lodi, Enrico Malaguti, Nicolás E. St...
CGF
2006
191views more  CGF 2006»
13 years 7 months ago
A Robust Two-Step Procedure for Quad-Dominant Remeshing
We propose a new technique for quad-dominant remeshing which separates the local regularity requirements from the global alignment requirements by working in two steps. In the fir...
Martin Marinov, Leif Kobbelt
WWW
2007
ACM
14 years 8 months ago
Long distance wireless mesh network planning: problem formulation and solution
Several research efforts as well as deployments have chosen IEEE 802.11 as a low-cost, long-distance access technology to bridge the digital divide. In this paper, we consider the...
Sayandeep Sen, Bhaskaran Raman