Sciweavers

1403 search results - page 21 / 281
» Set cover algorithms for very large datasets
Sort
View
VIS
2009
IEEE
205views Visualization» more  VIS 2009»
14 years 9 months ago
Time and Streak Surfaces for Flow Visualization in Large Time-Varying Data Sets
Time and streak surfaces are ideal tools to illustrate time-varying vector fields since they directly appeal to the intuition about coherently moving particles. However, efficient ...
Hari Krishnan, Christoph Garth, Kenneth I. Joy
ECCB
2005
IEEE
14 years 2 months ago
SIMAP - The similarity matrix of proteins
Similarity Matrix of Proteins (SIMAP) (http://mips.gsf. 10 de/simap) provides a database based on a precomputed similarity matrix covering the similarity space formed by .4 millio...
Roland Arnold, Thomas Rattei, Patrick Tischler, Mi...
ACTA
2007
92views more  ACTA 2007»
13 years 8 months ago
Solving #SAT using vertex covers
Abstract We propose an exact algorithm for counting the models of propositional formulas in conjunctive normal form (CNF). Our algorithm is based on the detection of strong backdoo...
Naomi Nishimura, Prabhakar Ragde, Stefan Szeider
TCAD
2002
110views more  TCAD 2002»
13 years 8 months ago
A constructive genetic algorithm for gate matrix layout problems
This paper describes an application of a Constructive Genetic Algorithm (CGA) to the Gate Matrix Layout Problem (GMLP). The GMLP happens in very large scale integration (VLSI) desi...
Alexandre César Muniz de Oliveira, Luiz Ant...
INFOCOM
2008
IEEE
14 years 2 months ago
On Survivable Access Network Design: Complexity and Algorithms
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...
Dahai Xu, Elliot Anshelevich, Mung Chiang