Sciweavers

1559 search results - page 168 / 312
» Some Group Theory Problems
Sort
View
ISCC
2002
IEEE
15 years 9 months ago
A new approach to construct multicast trees in MPLS networks
In this paper1 , we present a new approach to construct multicast trees in MPLS networks. This approach utilizes MPLS LSPs between multicast tree branching node routers in order to...
Ali Boudani, Bernard Cousin
CSCW
1998
ACM
15 years 8 months ago
Evaluating Image Filtering Based Techniques in Media Space Applications
Media space applications that promote informal awareness in an organization confront an inevitable paradox: the shared video connections between offices and rooms that promote inf...
Qiang Alex Zhao, John T. Stasko
JCM
2007
76views more  JCM 2007»
15 years 4 months ago
Scheduling Small Packets in IPSec Multi-accelerator Based Systems
—IPSec is a suite of protocols that adds security to communications at the IP level. Protocols within the IPSec suite make extensive use of cryptographic algorithms. Since these ...
Antonio Vincenzo Taddeo, Alberto Ferrante, Vincenz...
150
Voted
STOC
2009
ACM
155views Algorithms» more  STOC 2009»
16 years 5 months ago
A nearly optimal oracle for avoiding failed vertices and edges
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
Aaron Bernstein, David R. Karger
ICRA
2003
IEEE
101views Robotics» more  ICRA 2003»
15 years 9 months ago
A Branch-and-Prune Algorithm for Solving Systems of Distance Constraints
— Given a set of affine varieties in ℜ3, i.e. planes, lines, and points, the problem tackled in this paper is that of finding all possible configurations for these varieties...
Josep M. Porta, Federico Thomas, Lluís Ros,...