Sciweavers

283 search results - page 11 / 57
» Linked partitions and linked cycles
Sort
View
SPAA
2003
ACM
14 years 2 months ago
Information gathering in adversarial systems: lines and cycles
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...
Kishore Kothapalli, Christian Scheideler
JSAC
2007
107views more  JSAC 2007»
13 years 8 months ago
Admission control in data transfers over lightpaths
—The availability of optical network infrastructure and appropriate user control software has recently made it possible for scientists to establish end-to-end circuits across mul...
Wojciech M. Golab, Raouf Boutaba
ICPPW
2002
IEEE
14 years 1 months ago
Statistical Analysis of Connectivity in Unidirectional Ad Hoc Networks
A unidirectional link exists in an ad-hoc network when a node B is within the transmission range of another node A while node A cannot directly hear node B. However, a reverse rou...
Venugopalan Ramasubramanian, Daniel Mossé
VC
2008
172views more  VC 2008»
13 years 8 months ago
Consistent mesh partitioning and skeletonisation using the shape diameter function
Abstract Mesh partitioning and skeletonisation are fundamental for many computer graphics and animation techniques. Because of the close link between an object's skeleton and ...
Lior Shapira, Ariel Shamir, Daniel Cohen-Or
JMMA
2010
90views more  JMMA 2010»
13 years 3 months ago
A Unified Approach to Algorithms Generating Unrestricted and Restricted Integer Compositions and Integer Partitions
An original algorithm is presented that generates both restricted integer compositions and restricted integer partitions that can be constrained simultaneously by a) upper and low...
John Douglas Opdyke