Sciweavers

656 search results - page 11 / 132
» Large-Graph Layout Algorithms at Work: An Experimental Study
Sort
View
ISPD
2007
ACM
151views Hardware» more  ISPD 2007»
15 years 1 months ago
Pattern sensitive placement for manufacturability
When VLSI technology scales toward 45nm, the lithography wavelength stays at 193nm. This large gap results in strong refractive effects in lithography. Consequently, it is a huge...
Shiyan Hu, Jiang Hu
CVPR
2010
IEEE
15 years 7 months ago
Globally Optimal Pixel Labeling Algorithms for Tree Metrics
We consider pixel labeling problems where the label set forms a tree, and where the observations are also labels. Such problems arise in feature-space analysis with a very large...
Pedro Felzenszwalb, Gyula Pap, Eva Tardos, Ramin Z...
GECCO
2007
Springer
184views Optimization» more  GECCO 2007»
15 years 5 months ago
Experimental analysis of binary differential evolution in dynamic environments
Many real-world optimization problems are dynamic in nature. The interest in the Evolutionary Algorithms (EAs) community in applying EA variants to dynamic optimization problems h...
Alp Emre Kanlikilicer, Ali Keles, Sima Uyar
CIKM
2009
Springer
15 years 6 months ago
Fast shortest path distance estimation in large networks
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
Michalis Potamias, Francesco Bonchi, Carlos Castil...
CORR
2010
Springer
114views Education» more  CORR 2010»
14 years 10 months ago
On weakly optimal partitions in modular networks
Abstract. Modularity was introduced as a measure of goodness for the community structure induced by a partition of the set of vertices in a graph. Then, it also became an objective...
José Ignacio Alvarez-Hamelin, Beiró ...