Sciweavers

4526 search results - page 308 / 906
» Algorithmic problems related to the Internet
Sort
View
DCC
2001
IEEE
16 years 6 months ago
Towards Compressing Web Graphs
We consider the problem of compressing graphs of the link structure of the World Wide Web. We provide efficient algorithms for such compression that are motivated by recently prop...
Micah Adler, Michael Mitzenmacher
GECCO
2003
Springer
129views Optimization» more  GECCO 2003»
15 years 12 months ago
Finding Building Blocks through Eigenstructure Adaptation
A fundamental aspect of many evolutionary approaches to synthesis of complex systems is the need to compose atomic elements into useful higher-level building blocks. However, the ...
Danica Wyatt, Hod Lipson
HIS
2007
15 years 8 months ago
Active Selection of Training Examples for Meta-Learning
Meta-Learning has been used to relate the performance of algorithms and the features of the problems being tackled. The knowledge in Meta-Learning is acquired from a set of meta-e...
Ricardo Bastos Cavalcante Prudêncio, Teresa ...
FOCS
2003
IEEE
15 years 12 months ago
Switch Scheduling via Randomized Edge Coloring
The essence of an Internet router is an n ¡ n switch which routes packets from input to output ports. Such a switch can be viewed as a bipartite graph with the input and output p...
Gagan Aggarwal, Rajeev Motwani, Devavrat Shah, An ...
IMC
2006
ACM
16 years 19 days ago
Shared-state sampling
We present an algorithm, Shared-State Sampling (S3 ), for the problem of detecting large flows in high-speed networks. While devised with different principles in mind, S3 turns ...
Frederic Raspall, Sebastià Sallent, Josep Y...