Sciweavers

881 search results - page 47 / 177
» connection 2004
Sort
View
GD
1999
Springer
15 years 2 months ago
Isomorphic Subgraphs
The isomorphic subgraph problem is finding two disjoint subgraphs of a graph which coincide on at least k edges. The graph is partitioned into a subgraph, its copy, and a remaind...
Sabine Bachl
MMNS
2004
81views Multimedia» more  MMNS 2004»
14 years 11 months ago
Providing Seamless Mobility with Competition based Soft Handover Management
As host mobility and radio interference in wireless networks cause packet losses and delays, it is difficult to develop useful mobile real-time media applications. This paper descr...
Johan Kristiansson, Peter Parnes
CAGD
2004
121views more  CAGD 2004»
14 years 9 months ago
A conjecture on tangent intersections of surface patches
This note conjectures that if two surface patches intersect with G1 continuity along an entire curve, the probability is one that the curve is rational. This idea has significance...
Thomas W. Sederberg, Jianmin Zheng, Xiaowen Song
CN
2004
149views more  CN 2004»
14 years 9 months ago
Efficient dynamic traffic grooming in service-differentiated WDM mesh networks
In this paper, we address the issue of traffic grooming in arbitrary WDM mesh networks. We present a novel groomer architecture wherein a combination of grooming at two different ...
Harsha V. Madhyastha, C. Siva Ram Murthy
FMCAD
2008
Springer
14 years 11 months ago
Automatic Non-Interference Lemmas for Parameterized Model Checking
Parameterized model checking refers to any method that extends traditional, finite-state model checking to handle systems arbitrary number of processes. One popular approach to thi...
Jesse D. Bingham