Sciweavers

583 search results - page 49 / 117
» Computing Linking Numbers of a Filtration
Sort
View
IPPS
1998
IEEE
14 years 2 months ago
Fault Tolerant Mobility Planning for Rapidly Deployable Wireless Networks
Rapidly deployable wireless networks consist of mobile base stations and less powerful mobile hosts. The mobile base stations have to maintain wireless connectivity while on the mo...
Charles Shields Jr., Vikas Jain, Simeon C. Ntafos,...
ICPP
1997
IEEE
14 years 2 months ago
Design of a Circuit-Switched Highly Fault-Tolerant k-ary n-cube
In this paper, we present a strongly fault-tolerant design for the k-ary n-cube multiprocessor and examine its reconfigurability. Our design augments the k-ary n-cube with k j ...
Baback A. Izadi, Füsun Özgüner
BMVC
2001
14 years 10 days ago
An EM-like Algorithm for Motion Segmentation via Eigendecomposition
This paper presents an iterative maximum likelihood framework for motion segmentation via the pairwise checking of pixel blocks. We commence from a characterisation of the motion ...
Antonio Robles-Kelly, Edwin R. Hancock
ICNP
1999
IEEE
14 years 2 months ago
Effect of Unreliable Nodes on QoS Routing
A number of QoS routing algorithms have been proposed to address the dual objective of selecting feasible paths through the network with enough resources to satisfy a connections&...
Swapna S. Gokhale, Satish K. Tripathi
PODC
2004
ACM
14 years 3 months ago
Analyzing Kleinberg's (and other) small-world Models
We analyze the properties of Small-World networks, where links are much more likely to connect “neighbor nodes” than distant nodes. In particular, our analysis provides new re...
Charles U. Martel, Van Nguyen