Sciweavers

65 search results - page 4 / 13
» Local Enumeration Techniques for Sparse Algorithms
Sort
View
APGV
2006
ACM
15 years 11 months ago
Stevens dot patterns for 2D flow visualization
This paper describes a new technique to visualize 2D flow fields with a sparse collection of dots. A cognitive model proposed by Kent Stevens describes how spatially local con...
Laura Tateosian, Brent M. Dennis, Christopher G. H...
ICASSP
2011
IEEE
14 years 9 months ago
Content preference estimation in online social networks: Message passing versus sparse reconstruction on graphs
We design two different strategies for computing the unknown content preferences in an online social network based on a small set of nodes in the corresponding social graph for wh...
Jacob Chakareski
SIAMSC
2010
142views more  SIAMSC 2010»
15 years 11 days ago
Hypergraph-Based Unsymmetric Nested Dissection Ordering for Sparse LU Factorization
In this paper we present HUND, a hypergraph-based unsymmetric nested dissection ordering algorithm for reducing the fill-in incurred during Gaussian elimination. HUND has several i...
Laura Grigori, Erik G. Boman, Simplice Donfack, Ti...
GECCO
2007
Springer
153views Optimization» more  GECCO 2007»
15 years 11 months ago
Parallel genetic algorithm: assessment of performance in multidimensional scaling
Visualization of multidimensional data by means of Multidimensional Scaling (MDS) is a popular technique of exploratory data analysis widely usable, e.g. in analysis of bio-medica...
Antanas Zilinskas, Julius Zilinskas
SLS
2007
Springer
117views Algorithms» more  SLS 2007»
15 years 11 months ago
An Algorithm Portfolio for the Sub-graph Isomorphism Problem
Abstract. This work presents an algorithm for the sub-graph isomorphism problem based on a new pruning technique for directed graphs. During the tree search, the method checks if a...
Roberto Battiti, Franco Mascia