Sciweavers

1061 search results - page 77 / 213
» On Compact Routing for the Internet
Sort
View
WWW
2010
ACM
15 years 3 months ago
RDF compression: basic approaches
This paper studies the compressibility of RDF data sets. We show that big RDF data sets are highly compressible due to the structure of RDF graphs (power law), organization of URI...
Javier D. Fernández, Claudio Gutierrez, Mig...
LAWEB
2003
IEEE
15 years 3 months ago
The Best Trail Algorithm for Assisted Navigation of Web Sites
We present an algorithm called the Best Trail Algorithm, which helps solve the hypertext navigation problem by automating the construction of memex-like trails through the corpus....
Richard Wheeldon, Mark Levene
CONEXT
2007
ACM
15 years 1 months ago
Practical defenses against BGP prefix hijacking
Prefix hijacking, a misbehavior in which a misconfigured or malicious BGP router originates a route to an IP prefix it does not own, is becoming an increasingly serious security p...
Zheng Zhang, Ying Zhang, Y. Charlie Hu, Zhuoqing M...
SAINT
2005
IEEE
15 years 3 months ago
Fault-Tolerant Routing for P2P Systems with Unstructured Topology
New application scenarios, such as Internet-scale computations, nomadic networks and mobile systems, require decentralized, scalable and open infrastructures. The peerto-peer (P2P...
Leonardo Mariani
COR
2007
103views more  COR 2007»
14 years 10 months ago
A reactive GRASP and path relinking for a combined production-distribution problem
An NP-hard production–distribution problem for one product over a multi-period horizon is investigated. The aim is to minimize total cost taking production setups, inventory lev...
Mourad Boudia, Mohamed Aly Ould Louly, Christian P...