Sciweavers

2497 search results - page 161 / 500
» Requirements for models of achievable routing
Sort
View
WECWIS
2006
IEEE
129views ECommerce» more  WECWIS 2006»
15 years 8 months ago
Probing and Monitoring of WSBPEL Processes with Web Services
Today’s business climate requires organizations to constantly evolve IT strategies to respond to new opportunities or threats. Tracking the achievement of business goals, object...
Heinz Roth, Josef Schiefer, Alexander Schatten
GLOBECOM
2007
IEEE
15 years 8 months ago
A Novel Distributed Scheduling Algorithm for Wireless Mesh Networks
— Wireless multi-hop, mesh networks are being considered as a candidate to backhaul data traffic from access networks to the wired Internet. These mesh networks are referred to a...
Yun Hou, Kin K. Leung
140
Voted
IWCMC
2006
ACM
15 years 8 months ago
Low complexity virtual antenna arrays using cooperative relay selection
We study the diversity-multiplexing tradeoff in cooperative diversity systems involving multiple relays. We focus on low complexity architectures that do not require simultaneous...
Aggelos Bletsas, Ashish Khisti, Moe Z. Win
IPPS
2005
IEEE
15 years 7 months ago
Tight Bounds for Wavelength Assignment on Trees of Rings
: A fundamental problem in communication networks is wavelength assignment (WA): given a set of routing paths on a network, assign a wavelength to each path such that the paths wit...
Zhengbing Bian, Qian-Ping Gu, Xiao Zhou
CHES
2005
Springer
96views Cryptology» more  CHES 2005»
15 years 7 months ago
The "Backend Duplication" Method
Abstract. Several types of logic gates suitable for leakage-proof computations have been put forward [1,2,3,4]. This paper describes a method, called “backend duplication” to a...
Sylvain Guilley, Philippe Hoogvorst, Yves Mathieu,...