Sciweavers

249 search results - page 4 / 50
» Approximating the Bandwidth of Caterpillars
Sort
View
EWSN
2011
Springer
13 years 1 days ago
An Adaptive Algorithm for Compressive Approximation of Trajectory (AACAT) for Delay Tolerant Networks
Highly efficient compression provides a promising approach to address the transmission and computation challenges imposed by moving object tracking applications on resource constra...
Rajib Kumar Rana, Wen Hu, Tim Wark, Chun Tung Chou
ICC
2009
IEEE
140views Communications» more  ICC 2009»
13 years 6 months ago
Approximation Algorithms for Traffic Grooming in WDM Rings
Abstract-- This paper addresses the problem of traffic grooming in WDM rings in which all traffic emanates from a single node and all other nodes are destination nodes. This "...
Kevin Corcoran, Seth Flaxman, Mark Neyer, Peter Sc...
ICPR
2008
IEEE
14 years 9 months ago
Kernel bandwidth estimation in methods based on probability density function modelling
In kernel density estimation methods, an approximation of the data probability density function is achieved by locating a kernel function at each data location. The smoothness of ...
Adrian G. Bors, Nikolaos Nasios
SIGECOM
2009
ACM
109views ECommerce» more  SIGECOM 2009»
14 years 3 months ago
A new perspective on implementation by voting trees
Voting trees describe an iterative procedure for selecting a single vertex from a tournament. vide a very general abstract model of decision-making among a group of individuals, a...
Felix A. Fischer, Ariel D. Procaccia, Alex Samorod...
IPPS
2010
IEEE
13 years 6 months ago
Varying bandwidth resource allocation problem with bag constraints
We consider the problem of scheduling jobs on a pool of machines. Each job requires multiple machines on which it executes in parallel. For each job, the input specifies release ti...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Yogi...