Sciweavers

3016 search results - page 501 / 604
» The Online Transportation Problem
Sort
View
WEA
2010
Springer
316views Algorithms» more  WEA 2010»
15 years 9 months ago
Modularity-Driven Clustering of Dynamic Graphs
Maximizing the quality index modularity has become one of the primary methods for identifying the clustering structure within a graph. As contemporary networks are not static but e...
Robert Görke, Pascal Maillard, Christian Stau...
ITNG
2010
IEEE
15 years 9 months ago
A Fast and Stable Incremental Clustering Algorithm
— Clustering is a pivotal building block in many data mining applications and in machine learning in general. Most clustering algorithms in the literature pertain to off-line (or...
Steven Young, Itamar Arel, Thomas P. Karnowski, De...
WEBDB
2010
Springer
224views Database» more  WEBDB 2010»
15 years 9 months ago
Concurrent One-Way Protocols in Around-the-Clock Social Networks
We introduce and study concurrent One-Way Protocols in social networks. The model is motivated by the rise of online social networks and the fast development of automation feature...
Royi Ronen, Oded Shmueli
ECRTS
2002
IEEE
15 years 9 months ago
A QoS-Sensitive Approach for Timeliness and Freshness Guarantees in Real-Time Databases
The demand for real-time database services has been increasing recently. Examples include sensor data fusion, decision support, web information services, and online trading. In th...
Kyoung-Don Kang, Sang Hyuk Son, John A. Stankovic,...
ICNP
2002
IEEE
15 years 9 months ago
Dynamic Routing of Bandwidth Guaranteed Multicasts with Failure Backup
This paper presents a new algorithm for dynamic routing of bandwidth guaranteed multicast tunnels with failure backup. The multicast routing problem arises in many contexts such a...
Murali S. Kodialam, T. V. Lakshman