Sciweavers

4526 search results - page 112 / 906
» Algorithmic problems related to the Internet
Sort
View
JDA
2006
184views more  JDA 2006»
15 years 4 months ago
Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
Camil Demetrescu, Giuseppe F. Italiano
IEICET
2011
14 years 11 months ago
Minimum Spanning Tree Problem with Label Selection
In this paper, we study the minimum spanning tree problem for vertex-labeled graphs, where the weights of edges may vary depending on the selection of labels of vertices at both e...
Akio Fujiyoshi, Masakazu Suzuki
SEMWEB
2009
Springer
15 years 10 months ago
Results of OKKAM Feature based Entity Matching Algorithm for Instance Matching Contest of OAEI 2009
To investigate the problem of entity recognition, we deal with the creation of the so-called Entity Name System (ENS) which is an open, public back-bone infrastructure for the (Sem...
Heiko Stoermer, Nataliya Rassadko
VL
1994
IEEE
121views Visual Languages» more  VL 1994»
15 years 8 months ago
Using 3D Tubes to Solve the Intersecting Line Representation Problem
In this paper we discuss 3D rendering as a solution to the line crossing problem associated with using connecting lines for illustrating relations in visual programming. The Bezie...
Lindsey L. Spratt, Allen L. Ambler
TSMC
2008
172views more  TSMC 2008»
15 years 4 months ago
AdaBoost-Based Algorithm for Network Intrusion Detection
Abstract--Network intrusion detection aims at distinguishing the attacks on the Internet from normal use of the Internet. It is an indispensable part of the information security sy...
Weiming Hu, Wei Hu, Stephen J. Maybank