359 search results - page 34 / 72 » Online Algorithms for Disk Graphs |
108
click to vote
INFOCOM
2009
IEEE
15 years 6 months ago
2009
IEEE
—In this paper, we study an online bipartite matching problem, motivated by applications in wireless communication, content delivery, and job scheduling. In our problem, we have ...
PG
1997
IEEE
15 years 4 months ago
1997
IEEE
Recently, animations with deforming objects are frequently used in various Computer Graphics applications. Metamorphosis (or morphing) of three dimensional objects is one of techn...
SIROCCO
2007
15 years 1 months ago
2007
Abstract. A large group of autonomous, mobile entities e.g. robots initially placed at some arbitrary node of the graph has to jointly visit all nodes (not necessarily all edges) a...
ICML
2010
IEEE
15 years 24 days ago
2010
IEEE
We develop a novel online learning algorithm for the group lasso in order to efficiently find the important explanatory factors in a grouped manner. Different from traditional bat...
107
click to vote
ICDCS
2006
IEEE
15 years 5 months ago
2006
IEEE
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...