Sciweavers

239 search results - page 39 / 48
» The path partition problem and related problems in bipartite...
Sort
View
INFOCOM
2000
IEEE
14 years 6 hour ago
QoS Routing with Performance-Dependent Costs
Abstract—We study a network model in which each network link is associated with a set of delays and costs. These costs are a function of the delays and reflect the prices paid i...
Funda Ergün, Rakesh K. Sinha, Lisa Zhang
ANOR
2005
102views more  ANOR 2005»
13 years 7 months ago
Locating Active Sensors on Traffic Networks
Sensors are used to monitor traffic in networks. For example, in transportation networks, they may be used to measure traffic volumes on given arcs and paths of the network. This p...
Monica Gentili, Pitu B. Mirchandani
WEA
2005
Springer
98views Algorithms» more  WEA 2005»
14 years 1 months ago
Implementing Minimum Cycle Basis Algorithms
Abstract. In this paper we consider the problem of computing a minimum cycle basis of an undirected graph G = (V, E) with n vertices and m edges. We describe an efficient implement...
Kurt Mehlhorn, Dimitrios Michail
IJCAI
2007
13 years 9 months ago
Improving Author Coreference by Resource-Bounded Information Gathering from the Web
Accurate entity resolution is sometimes impossible simply due to insufficient information. For example, in research paper author name resolution, even clever use of venue, title ...
Pallika Kanani, Andrew McCallum, Chris Pal
WS
2004
ACM
14 years 1 months ago
Trust evaluation in ad-hoc networks
Title of Thesis: DISTRIBUTED TRUST EVALUATION IN AD-HOC NETWORKS Georgios E. Theodorakopoulos, Master of Science, 2004 Thesis directed by: Professor John S. Baras Department of El...
George Theodorakopoulos, John S. Baras