Sciweavers

7133 search results - page 1310 / 1427
» Communication algorithms with advice
Sort
View
JGAA
2000
85views more  JGAA 2000»
13 years 9 months ago
Techniques for the Refinement of Orthogonal Graph Drawings
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...
Janet M. Six, Konstantinos G. Kakoulis, Ioannis G....
CONCURRENCY
1998
115views more  CONCURRENCY 1998»
13 years 9 months ago
Falcon: On-line monitoring for steering parallel programs
Abstract Advances in high performance computing, communications, and user interfaces enable developers to construct increasingly interactive high performance applications. The Falc...
Weiming Gu, Greg Eisenhauer, Karsten Schwan, Jeffr...
TIT
1998
69views more  TIT 1998»
13 years 9 months ago
Relationships Between the Constant Modulus and Wiener Receivers
— The Godard or the constant modulus algorithm (CMA) is an effective technique for blind receiver design in communications. However, due to the complexity of the Constant Modulus...
Hanks H. Zeng, Lang Tong, C. Richard Johnson Jr.
SP
2002
IEEE
140views Security Privacy» more  SP 2002»
13 years 9 months ago
Efficient Multicast Packet Authentication Using Signature Amortization
We describe a novel method for authenticating multicast packets that is robust against packet loss. Our main focus is to minimize the size of the communication overhead required t...
Jung Min Park, Edwin K. P. Chong, Howard Jay Siege...
MMS
2007
13 years 9 months ago
Modeling user context with applications to media retrieval
In this paper, we develop a theoretical understanding of multi-sensory knowledge and user context and their interrelationships. This is used to develop a generic representation fr...
Ankur Mani, Hari Sundaram
« Prev « First page 1310 / 1427 Last » Next »