2430 search results - page 362 / 486 » Computing Tutte Polynomials |
135
Voted
INFOCOM
2005
IEEE
15 years 9 months ago
2005
IEEE
— With the constraints of network topologies and link capacities, achieving the optimal end-to-end throughput in data networks has been known as a fundamental but computationally...
141
click to vote
SMI
2005
IEEE
15 years 9 months ago
2005
IEEE
We propose an algorithm for contouring k-manifolds (k = 1, 2) embedded in an arbitrary n-dimensional space. We assume (n−k) geometric constraints are represented as polynomial e...
103
Voted
MINENET
2005
ACM
15 years 9 months ago
2005
ACM
Faults in an IP network have various causes such as the failure of one or more routers at the IP layer, fiber-cuts, failure of physical elements at the optical layer, or extraneo...
151
Voted
ESA
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Traditional shortest path problems play a central role in both the design and use of communication networks and have been studied extensively. In this work, we consider a...
147
click to vote
ESORICS
2005
Springer
15 years 9 months ago
2005
Springer
The freedom and transparency of information flow on the Internet has heightened concerns of privacy. Given a set of data items, clustering algorithms group similar items together...