Sciweavers

2796 search results - page 544 / 560
» The coolest path problem
Sort
View
IOR
2007
89views more  IOR 2007»
14 years 11 months ago
Fast, Fair, and Efficient Flows in Networks
Abstract. We study the problem of minimizing the maximum latency of flows in networks with congestion. We show that this problem is NP-hard, even when all arc latency functions ar...
José R. Correa, Andreas S. Schulz, Nicol&aa...
TMC
2008
192views more  TMC 2008»
14 years 11 months ago
A Bidding Algorithm for Optimized Utility-Based Resource Allocation in Ad Hoc Networks
Abstract-- This article proposes a scheme for bandwidth allocation in wireless ad hoc networks. The quality of service (QoS) levels for each end-to-end flow are expressed using a r...
Calin Curescu, Simin Nadjm-Tehrani
JGAA
2007
124views more  JGAA 2007»
14 years 11 months ago
Simultaneous Border Segmentation of Doughnut-Shaped Objects in Medical Images
Image segmentation with specific constraints has found applications in several areas such as biomedical image analysis and data mining. In this paper, we study the problem of sim...
Xiaodong Wu, Michael B. Merickel
TWC
2008
135views more  TWC 2008»
14 years 11 months ago
Optimal Distributed Stochastic Routing Algorithms for Wireless Multihop Networks
A novel framework was introduced recently for stochastic routing in wireless multihop networks, whereby each node selects a neighbor to forward a packet according to a probability...
Alejandro Ribeiro, Nikolas D. Sidiropoulos, Georgi...
CGF
2004
86views more  CGF 2004»
14 years 11 months ago
Procedural Texture Matching and Transformation
We present a technique for creating a smoothly varying sequence of procedural textures that interpolates between arbitrary input samples of texture. This texture transformation us...
Eric Bourque, Gregory Dudek