Sciweavers

407 search results - page 15 / 82
» The Optimal Online Algorithms for Minimizing Maximum Latenes...
Sort
View
PPL
2000
91views more  PPL 2000»
14 years 9 months ago
A Parallel Algorithm for Planar Orthogonal Grid Drawings
In this paper we consider the problem of constructing planar orthogonal grid drawings or more simply, layouts of graphs, with the goal of minimizing the number of bends along the ...
Roberto Tamassia, Ioannis G. Tollis, Jeffrey Scott...
KDD
2004
ACM
158views Data Mining» more  KDD 2004»
15 years 10 months ago
A generalized maximum entropy approach to bregman co-clustering and matrix approximation
Co-clustering is a powerful data mining technique with varied applications such as text clustering, microarray analysis and recommender systems. Recently, an informationtheoretic ...
Arindam Banerjee, Inderjit S. Dhillon, Joydeep Gho...
MOBIHOC
2002
ACM
15 years 9 months ago
Algorithmic aspects of topology control problems for ad hoc networks
Topology control problems are concerned with the assignment of power values to the nodes of an ad hoc network so that the power assignment leads to a graph topology satisfying som...
Errol L. Lloyd, Rui Liu, Madhav V. Marathe, Ram Ra...
INFOCOM
2002
IEEE
15 years 2 months ago
Optimal on-line estimation of the size of a dynamic multicast group
Abstract—In this paper we propose an efficient on-line estimation algorithm for determining the size of a dynamic multicast group. By using diffusion approximation and Kalman ...
Sara Alouf, Eitan Altman, Philippe Nain
HPCC
2007
Springer
15 years 3 months ago
Online Algorithms for Single Machine Schedulers to Support Advance Reservations from Grid Jobs
Advance Reservations(AR) make it possible to guarantee the QoS of Grid applications by reserving a particular resource capability over a defined time interval on local resources. H...
Bo Li, Dongfeng Zhao