Sciweavers

12 search results - page 2 / 3
» Practical Bootstrapping in Quasilinear Time
Sort
View
MOBIQUITOUS
2007
IEEE
13 years 11 months ago
TRULLO - local trust bootstrapping for ubiquitous devices
—Handheld devices have become sufficiently powerful that it is easy to create, disseminate, and access digital content (e.g., photos, videos) using them. The volume of such cont...
Daniele Quercia, Stephen Hailes, Licia Capra
EOR
2011
127views more  EOR 2011»
13 years 7 days ago
Methodology for determining the acceptability of system designs in uncertain environments
In practice, managers often wish to ascertain that a particular engineering design of a production system meets their requirements. The future environment of this design is likely...
Jack P. C. Kleijnen, Henri Pierreval, Jin Zhang
ISAAC
2003
Springer
141views Algorithms» more  ISAAC 2003»
13 years 10 months ago
Quasi-optimal Arithmetic for Quaternion Polynomials
Abstract. Fast algorithms for arithmetic on real or complex polynomials are wellknown and have proven to be not only asymptotically efficient but also very practical. Based on Fas...
Martin Ziegler
INFOCOM
2008
IEEE
13 years 11 months ago
Fast and Distributed Computation of Schedules in Wireless Networks
—In a wireless network with node exclusive spectrum sharing, two popular schedules are maximum weight matching (MWM) schedule and maximum size matching (MSM) schedule. The former...
Supratim Deb, Karan Mangla, K. V. M. Naidu
ICC
2007
IEEE
130views Communications» more  ICC 2007»
13 years 11 months ago
A Novel Key Redistribution Scheme for Wireless Sensor Networks
— Key management has long been a challenging problem in wireless Distributed Sensor Networks (DSNs) due to their high security requirements and strict resource constraints. Recen...
Chun-Fai Law, Ka-Shun Hung, Yu-Kwong Kwok