Sciweavers

14548 search results - page 2487 / 2910
» The Optimal Path-Matching Problem
Sort
View
SPAA
2006
ACM
16 years 23 days ago
Playing push vs pull: models and algorithms for disseminating dynamic data in networks
Consider a network in which a collection of source nodes maintain and periodically update data objects for a collection of sink nodes, each of which periodically accesses the data...
R. C. Chakinala, Abishek Kumarasubramanian, Kofi A...
BROADNETS
2005
IEEE
16 years 14 days ago
Dual-link failure resiliency through backup link mutual exclusion
— Networks employ link protection to achieve fast recovery from link failures. While the first link failure can be protected using link protection, there are several alternative...
Amit Chandak, Srinivasan Ramasubramanian
P2P
2005
IEEE
106views Communications» more  P2P 2005»
16 years 12 days ago
Chord on Demand
Structured peer-to-peer overlay networks are now an established paradigm for implementing a wide range of distributed services. While the problem of maintaining these networks in ...
Alberto Montresor, Márk Jelasity, Özal...
SMI
2005
IEEE
16 years 12 days ago
Two-Dimensional Visibility Charts for Continuous Curves
This paper considers computation of visibility for twodimensional shapes whose boundaries are C1 continuous curves. We assume we are given a one-parameter family of candidate view...
Gershon Elber, Robert Sayegh, Gill Barequet, Ralph...
WISE
2005
Springer
16 years 12 days ago
Scalable Instance Retrieval for the Semantic Web by Approximation
Abstract. Approximation has been identified as a potential way of reducing the complexity of logical reasoning. Here we explore approximation for speeding up instance retrieval in...
Holger Wache, Perry Groot, Heiner Stuckenschmidt
« Prev « First page 2487 / 2910 Last » Next »