Sciweavers

5153 search results - page 886 / 1031
» Introduction to Randomized Algorithms
Sort
View
TAMC
2010
Springer
15 years 7 months ago
Community Structure in Large Complex Networks
In this paper, we establish the definition of community fundamentally different from what was commonly accepted in previous studies, where communities were typically assumed to ...
Liaoruo Wang, John E. Hopcroft
FOCS
2002
IEEE
15 years 7 months ago
Covering Problems with Hard Capacities
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...
Julia Chuzhoy, Joseph Naor
ICNP
2002
IEEE
15 years 7 months ago
Hybrid Channel Access Scheduling in Ad Hoc Networks
We present the hybrid activation multiple access (HAMA) protocol for ad hoc networks. Unlike previous channel access scheduling protocols that activate either nodes or links only,...
Lichun Bao, J. J. Garcia-Luna-Aceves
CIAC
2010
Springer
252views Algorithms» more  CIAC 2010»
15 years 7 months ago
On the Number of Higher Order Delaunay Triangulations
Higher order Delaunay triangulations are a generalization of the Delaunay triangulation which provides a class of well-shaped triangulations, over which extra criteria can be optim...
Dieter Mitsche, Maria Saumell, Rodrigo I. Silveira
GECCO
2009
Springer
139views Optimization» more  GECCO 2009»
15 years 7 months ago
Meta-heuristics for reconstructing cross cut shredded text documents
In this work, we present two new approaches based on variable neighborhood search (VNS) and ant colony optimization (ACO) for the reconstruction of cross cut shredded text documen...
Matthias Prandtstetter, Günther R. Raidl