Sciweavers

4201 search results - page 420 / 841
» Interaction graphs: Additives
Sort
View
MOBICOM
2003
ACM
16 years 6 days ago
Minimum energy disjoint path routing in wireless ad-hoc networks
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
Anand Srinivas, Eytan Modiano
TON
2008
119views more  TON 2008»
15 years 6 months ago
Polynomial time approximation algorithms for multi-constrained QoS routing
We study the multi-constrained Quality-of-Service (QoS) routing problem where one seeks to find a path from a source to a destination in the presence of K 2 additive end-to-end Qo...
Guoliang Xue, Weiyi Zhang, Jian Tang, Krishnaiyan ...
IEEEPACT
1999
IEEE
15 years 11 months ago
On Reducing False Sharing while Improving Locality on Shared Memory Multiprocessors
The performance of applications on large shared-memory multiprocessors with coherent caches depends on the interaction between the granularity of data sharing, the size of the coh...
Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanuja...
ICIP
2001
IEEE
16 years 8 months ago
Curves vs skeletons in object recognition
The type of representation used in describing shape can have a significant impact on the effectiveness of a recognition strategy. Shape has been represented by its bounding curve ...
Thomas B. Sebastian, Benjamin B. Kimia
MICCAI
2006
Springer
16 years 8 months ago
An Energy Minimization Approach to the Data Driven Editing of Presegmented Images/Volumes
Fully automatic, completely reliable segmentation in medical images is an unrealistic expectation with today's technology. However, many automatic segmentation algorithms may ...
Leo Grady, Gareth Funka-Lea