Sciweavers

818 search results - page 138 / 164
» Network bargaining: algorithms and structural results
Sort
View
ANOR
2007
80views more  ANOR 2007»
13 years 7 months ago
The minimum shift design problem
The min-SHIFT DESIGN problem (MSD) is an important scheduling problem that needs to be solved in many industrial contexts. The issue is to find a minimum number of shifts and the...
Luca Di Gaspero, Johannes Gärtner, Guy Kortsa...
NN
2002
Springer
226views Neural Networks» more  NN 2002»
13 years 7 months ago
Data visualisation and manifold mapping using the ViSOM
The self-organising map (SOM) has been successfully employed as a nonparametric method for dimensionality reduction and data visualisation. However, for visualisation the SOM requ...
Hujun Yin
GIS
2004
ACM
14 years 8 months ago
A new approach for a topographic feature-based characterization of digital elevation data
Triangular Irregular Network (TIN) and Regular Square Grid (RSG) are widely used for representing 2.5 dimensional spatial data. However, these models are not defined from the topo...
Eric Saux, Ki-Joune Li, Min-Hwan Kim, Rémy ...
WWW
2007
ACM
14 years 8 months ago
Query-driven indexing for peer-to-peer text retrieval
We describe a query-driven indexing framework for scalable text retrieval over structured P2P networks. To cope with the bandwidth consumption problem that has been identified as ...
Gleb Skobeltsyn, Toan Luu, Karl Aberer, Martin Raj...
SIGMETRICS
2008
ACM
181views Hardware» more  SIGMETRICS 2008»
13 years 7 months ago
Counter braids: a novel counter architecture for per-flow measurement
Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amo...
Yi Lu, Andrea Montanari, Balaji Prabhakar, Sarang ...