Sciweavers

1709 search results - page 204 / 342
» networks 2000
Sort
View
136
Voted
IV
2000
IEEE
123views Visualization» more  IV 2000»
15 years 8 months ago
Mapping Information onto 3D Virtual Worlds
This paper presents a strategy for automatically mapping information onto visual parameters in the field of three-dimensional (3D) information visualization. The work presented h...
Cristina Russo Dos Santos, Pascal Gros, Pierre Abe...
160
Voted
INFOCOM
2000
IEEE
15 years 7 months ago
A Predictability Analysis of Network Traffic
This paper assesses the predictability of network traffic by considering two metrics: (1) how far into the future a traffic rate process can be predicted with bounded error; (2) w...
Aimin Sang, San-qi Li
148
Voted
CCS
2007
ACM
15 years 9 months ago
How much anonymity does network latency leak?
Low-latency anonymity systems such as Tor, AN.ON, Crowds, and Anonymizer.com aim to provide anonymous connections that are both untraceable by “local” adversaries who control ...
Nicholas Hopper, Eugene Y. Vasserman, Eric Chan-Ti...
145
Voted
ORL
2006
105views more  ORL 2006»
15 years 3 months ago
Inventory placement in acyclic supply chain networks
The strategic safety stock placement problem is a constrained separable concave minimization problem and so is solvable, in principle, as a sequence of mixed-integer programming p...
Thomas L. Magnanti, Zuo-Jun Max Shen, Jia Shu, Dav...
149
Voted
OPODIS
2007
15 years 5 months ago
Small-World Networks: From Theoretical Bounds to Practical Systems
Abstract. In small-world networks, each peer is connected to its closest neighbors in the network topology, as well as to additional long-range contact(s), also called shortcut(s)....
François Bonnet, Anne-Marie Kermarrec, Mich...