Sciweavers

381 search results - page 44 / 77
» On the advantage over a random assignment
Sort
View
ANCS
2008
ACM
13 years 10 months ago
On design of bandwidth scheduling algorithms for multiple data transfers in dedicated networks
The significance of high-performance dedicated networks has been well recognized due to the rapidly increasing number of large-scale applications that require high-speed data tran...
Yunyue Lin, Qishi Wu
HIS
2008
13 years 9 months ago
A GRASP Algorithm Using RNN for Solving Dynamics in a P2P Live Video Streaming Network
In this paper, we present an algorithm based on the GRASP metaheuristic for solving a dynamic assignment problem in a P2P network designed for sending real-time video over the Int...
Marcelo Martínez, Alexis Morón, Fran...
STOC
2009
ACM
171views Algorithms» more  STOC 2009»
14 years 8 months ago
On the geometry of graphs with a forbidden minor
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
James R. Lee, Anastasios Sidiropoulos
KDD
2008
ACM
183views Data Mining» more  KDD 2008»
14 years 8 months ago
Knowledge transfer via multiple model local structure mapping
The effectiveness of knowledge transfer using classification algorithms depends on the difference between the distribution that generates the training examples and the one from wh...
Jing Gao, Wei Fan, Jing Jiang, Jiawei Han
PODS
2008
ACM
159views Database» more  PODS 2008»
14 years 8 months ago
Approximation algorithms for clustering uncertain data
There is an increasing quantity of data with uncertainty arising from applications such as sensor network measurements, record linkage, and as output of mining algorithms. This un...
Graham Cormode, Andrew McGregor