Sciweavers

4998 search results - page 780 / 1000
» The case for intentional networking
Sort
View
ICNP
1999
IEEE
14 years 1 months ago
Scaling End-to-End Multicast Transports with a Topologically-Sensitive Group Formation Protocol
While the IP unicast service has proven successful, extending end-to-end adaptation to multicast has been a difficult problem. Unlike the unicast case, multicast protocols must su...
Sylvia Ratnasamy, Steven McCanne
INFOCOM
1997
IEEE
14 years 1 months ago
A Distributed Algorithm for Delay-Constrained Unicast Routing
In this paper, we study the NP-hard delay-constrained least-cost path problem. A solution to this problem is needed to provide real-time communication service to connection-orient...
Hussein F. Salama, Douglas S. Reeves, Yannis Vinio...
DAGM
1997
Springer
14 years 1 months ago
A Feature Map Approach to Real-Time 3-D Object Pose Estimation from Single 2-D Perspective Views
A novel approach to the computation of an approximate estimate of spatial object pose from camera images is proposed. The method is based on a neural network that generates pose hy...
S. Winkler, Patrick Wunsch, Gerd Hirzinger
PODC
1993
ACM
14 years 1 months ago
A Lower Bound on Wait-Free Counting
A counting protocol (mod m) consists of shared memory bits - referred to as the counter - and of a procedure for incrementing the counter value by 1 (mod m). The procedure may be ...
Shlomo Moran, Gadi Taubenfeld
CP
2007
Springer
14 years 1 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti