Sciweavers

1487 search results - page 34 / 298
» The Computational Complexity of Link Building
Sort
View
INFOCOM
2005
IEEE
14 years 2 months ago
Avoiding transient loops during IGP convergence in IP networks
— When the topology of an IP network changes due to a link failure or a link weight modification, the routing tables of all the routers must be updated. Each of those updates ma...
Pierre Francois, Olivier Bonaventure
COLING
2002
13 years 8 months ago
Complexity of Event Structure in IE Scenarios
This paper presents new Information Extraction scenarios which are linguistically and structurally more challenging than the traditional MUC scenarios. Traditional views on event ...
Silja Huttunen, Roman Yangarber, Ralph Grishman
IWCMC
2010
ACM
14 years 1 months ago
Estimating routing symmetry on single links by passive flow measurements
The assumption of routing symmetry is often embedded into traffic analysis and classification tools. This paper uses passively captured network data to estimate the amount of tra...
Wolfgang John, Maurizio Dusi, Kimberly C. Claffy
GECCO
2010
Springer
157views Optimization» more  GECCO 2010»
14 years 1 months ago
Configuration of a genetic algorithm for multi-objective optimisation of solar gain to buildings
We report the formulation and implementation of a genetic algorithm to address multi-objective optimisation of solar gain to buildings with the goal of minimising energy consumpti...
Ralph Evins
ICDE
2008
IEEE
150views Database» more  ICDE 2008»
14 years 9 months ago
Link Privacy in Social Networks
We consider a privacy threat to a social network in which the goal of an attacker is to obtain knowledge of a significant fraction of the links in the network. We formalize the ty...
Aleksandra Korolova, Rajeev Motwani, Shubha U. Nab...