Sciweavers

1736 search results - page 302 / 348
» On antimagic directed graphs
Sort
View
CRYPTO
2001
Springer
152views Cryptology» more  CRYPTO 2001»
14 years 2 months ago
Secure Distributed Linear Algebra in a Constant Number of Rounds
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
Ronald Cramer, Ivan Damgård
NOSSDAV
2001
Springer
14 years 2 months ago
Network support for mobile multimedia using a self-adaptive distributed proxy
Recent advancements in video and audio codec technologies (e.g., RealVideo [18]) make multimedia streaming possible across a wide range of network conditions. With an increasing t...
Zhuoqing Morley Mao, Hoi-sheung Wilson So, Byungho...
SPAA
1999
ACM
14 years 2 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...
VRML
1999
ACM
14 years 2 months ago
VIRTUS: A Collaborative Multi-User Platform
VRML is a file format for the description of dynamic scene graphs containing 3D objects with their visual appearance, multimedia content, an event model, and scripting capabilitie...
Kurt Saar
IPPS
1999
IEEE
14 years 2 months ago
Process Networks as a High-Level Notation for Metacomputing
Abstract. Our work involves the development of a prototype Geographical Information System GIS as an example of the use of process networks as a well-de ned high-level semantic mod...
Darren Webb, Andrew L. Wendelborn, Kevin Maciunas