Sciweavers

656 search results - page 7 / 132
» Large-Graph Layout Algorithms at Work: An Experimental Study
Sort
View
ICDM
2002
IEEE
448views Data Mining» more  ICDM 2002»
15 years 2 months ago
Feature Selection Algorithms: A Survey and Experimental Evaluation
In view of the substantial number of existing feature selection algorithms, the need arises to count on criteria that enables to adequately decide which algorithm to use in certai...
Luis Carlos Molina, Lluís Belanche, À...
COCOON
2006
Springer
15 years 1 months ago
Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem
Many real-life scheduling, routing and location problems can be formulated as combinatorial optimization problems whose goal is to find a linear layout of an input graph in such a ...
Christoph Buchheim, Lanbo Zheng
CORR
2007
Springer
78views Education» more  CORR 2007»
14 years 9 months ago
Tag-Cloud Drawing: Algorithms for Cloud Visualization
Tag clouds provide an aggregate of tag-usage statistics. They are typically sent as in-line HTML to browsers. However, display mechanisms suited for ordinary text are not ideal fo...
Owen Kaser, Daniel Lemire
IPPS
2007
IEEE
15 years 3 months ago
Nonuniformly Communicating Noncontiguous Data: A Case Study with PETSc and MPI
Due to the complexity associated with developing parallel applications, scientists and engineers rely on highlevel software libraries such as PETSc, ScaLAPACK and PESSL to ease th...
Pavan Balaji, Darius Buntinas, Satish Balay, Barry...
ASPDAC
2005
ACM
111views Hardware» more  ASPDAC 2005»
14 years 11 months ago
Placement with symmetry constraints for analog layout design using TCG-S
In order to handle device matching for analog circuits, some pairs of modules need to be placed symmetrically with respect to a common axis. In this paper, we deal with the module...
Jai-Ming Lin, Guang-Ming Wu, Yao-Wen Chang, Jen-Hu...