Sciweavers

598 search results - page 77 / 120
» The Structure of Sparse Resultant Matrices
Sort
View
SLS
2007
Springer
117views Algorithms» more  SLS 2007»
15 years 10 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
111
Voted
SIAMSC
2008
123views more  SIAMSC 2008»
15 years 3 months ago
Balanced Incomplete Factorization
In this paper we present a new incomplete factorization of a square matrix into triangular factors in which we get standard LU or LDLT factors (direct factors) and their inverses (...
Rafael Bru, José Marín, José ...
140
Voted
CIKM
2009
Springer
15 years 10 months ago
Networks, communities and kronecker products
Emergence of the web and online computing applications gave rise to rich large scale social activity data. One of the principal challenges then is to build models and understandin...
Jure Leskovec
137
Voted
ESWS
2006
Springer
15 years 7 months ago
Semantic Network Analysis of Ontologies
A key argument for modeling knowledge in ontologies is the easy re-use and re-engineering of the knowledge. However, beside consistency checking, current ontology engineering tools...
Bettina Hoser, Andreas Hotho, Robert Jäschke,...
ICCV
2009
IEEE
16 years 7 months ago
Sparsity Induced Similarity Measure for Label Propagation
Graph-based semi-supervised learning has gained considerable interests in the past several years thanks to its effectiveness in combining labeled and unlabeled data through labe...
Hong Cheng, Zicheng Liu, Jie Yang