Sciweavers

583 search results - page 90 / 117
» Computing Linking Numbers of a Filtration
Sort
View
SDM
2007
SIAM
137views Data Mining» more  SDM 2007»
13 years 11 months ago
Are approximation algorithms for consensus clustering worthwhile?
Consensus clustering has emerged as one of the principal clustering problems in the data mining community. In recent years the theoretical computer science community has generated...
Michael Bertolacci, Anthony Wirth
FOIS
2006
13 years 11 months ago
Nontological Engineering
This article reflects an ongoing effort to systematize the use of terms applied by philosophers and computer scientists in the context of ontology and ontological engineering. We s...
Waclaw Kusnierczyk
ISCAPDCS
2003
13 years 11 months ago
Design and Analysis of Improved Shortest Path Tree Update for Network Routing
The quick construction of the Shortest Path Tree (SPT) is essential to achieve fast routing speed for an interior network using link state protocols, such as OSPF and IS-IS. Whene...
Bin Xiao, Qingfeng Zhuge, Zili Shao, Edwin Hsing-M...
EOR
2010
102views more  EOR 2010»
13 years 10 months ago
The Tree of Hubs Location Problem
The Tree-of-Hubs Location Problem is studied. This problem, which combines several aspects of some location, network design and routing problems, is inspired by those transportati...
Iván A. Contreras, Elena Fernández, ...
CCR
2006
81views more  CCR 2006»
13 years 10 months ago
LTCP: improving the performance of TCP in highspeed networks
In this paper, we propose Layered TCP (LTCP for short), a set of simple modifications to the congestion window response of TCP to make it more scalable in highspeed networks. LTCP...
Sumitha Bhandarkar, Saurabh Jain, A. L. Narasimha ...