Sciweavers

10051 search results - page 1389 / 2011
» A Dynamic Separator Algorithm
Sort
View
IPPS
2005
IEEE
16 years 20 days ago
On the Optimal Placement of Secure Data Objects over Internet
Secret sharing algorithms have been used for intrusion tolerance, which ensure the confidentiality, integrity and availability of critical information. However, dynamically changi...
Manghui Tu, Peng Li, Qingkai Ma, I-Ling Yen, Farok...
SI3D
2005
ACM
16 years 19 days ago
Towards space: time light field rendering
So far extending light field rendering to dynamic scenes has been trivially treated as the rendering of static light fields stacked in time. This type of approaches requires inp...
Huamin Wang, Ruigang Yang
ADHOCNOW
2004
Springer
16 years 15 days ago
Weathering the Storm: Managing Redundancy and Security in Ad Hoc Networks
Many ad hoc routing algorithms rely on broadcast flooding for location discovery or more generally for secure routing applications, particularly when dealing with Byzantine threat...
Mike Burmester, Tri Van Le, Alec Yasinsac
SPAA
1997
ACM
15 years 11 months ago
Accessing Nearby Copies of Replicated Objects in a Distributed Environment
Consider a set of shared objects in a distributed network, where several copies of each object may exist at any given time. To ensure both fast access to the objects as well as e ...
C. Greg Plaxton, Rajmohan Rajaraman, Andréa...
ACMICEC
2008
ACM
270views ECommerce» more  ACMICEC 2008»
15 years 9 months ago
Adaptive strategies for predicting bidding prices in supply chain management
Supply Chain Management (SCM) involves a number of interrelated activities from negotiating with suppliers to competing for customer orders and scheduling the manufacturing proces...
Yevgeniya Kovalchuk, Maria Fasli
« Prev « First page 1389 / 2011 Last » Next »