Sciweavers

16404 search results - page 2997 / 3281
» A set coverage problem
Sort
View
139
Voted
IPPS
2006
IEEE
15 years 11 months ago
k-anycast routing schemes for mobile ad hoc networks
— Anycast is a communication paradigm that was first introduced to the suit of routing protocols in IPv6 networks. In anycast, a packet is intended to be delivered to one of the...
Bing Wu, Jie Wu
KBSE
2006
IEEE
15 years 11 months ago
Detecting Precedence-Related Advice Interference
Aspect-Oriented Programming (AOP) has been proposed in literature to overcome modularization shortcomings such as the tyranny of the dominant decomposition. However, the new langu...
Maximilian Storzer, Florian Forster
P2P
2006
IEEE
122views Communications» more  P2P 2006»
15 years 11 months ago
2Fast : Collaborative Downloads in P2P Networks
P2P systems that rely on the voluntary contribution of bandwidth by the individual peers may suffer from freeriding. To address this problem, mechanisms enforcing fairness in band...
Pawel Garbacki, Alexandru Iosup, Dick H. J. Epema,...
SIBGRAPI
2006
IEEE
15 years 11 months ago
Determining the branchings of 3D structures from respective 2D projections
This work describes a new framework for automatic extraction of 2D branching structures images obtained from 3D shapes, such as neurons and retinopathy images. The majority of met...
Jorge J. G. Leandro, Roberto M. Cesar, Luciano da ...
MOBICOM
2006
ACM
15 years 11 months ago
Localized algorithm for aggregate fairness in wireless sensor networks
For data-collection applications in sensor networks, it is important to ensure all data sources have equal (or weighted) access to network bandwidth so that the base stations rece...
Shigang Chen, Zhan Zhang
« Prev « First page 2997 / 3281 Last » Next »