Sciweavers

779 search results - page 130 / 156
» Algorithms for the Sample Mean of Graphs
Sort
View
SAT
2005
Springer
133views Hardware» more  SAT 2005»
15 years 5 months ago
Solving Over-Constrained Problems with SAT Technology
Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clau...
Josep Argelich, Felip Manyà
BIOCOMP
2008
15 years 1 months ago
GIPSCo: A Method for Comparison of Protein Structures Based on Geometric Invariants
Protein structure comparison is important for elucidation of evolutionary relationships, function and functionally important amino acid residues. We propose Geometric Invariant bas...
Sandeep Deshmukh, Aniket Dalal, Pramod Wangikar
WAW
2004
Springer
178views Algorithms» more  WAW 2004»
15 years 5 months ago
Communities Detection in Large Networks
We develop an algorithm to detect community structure in complex networks. The algorithm is based on spectral methods and takes into account weights and links orientations. Since t...
Andrea Capocci, Vito Domenico Pietro Servedio, Gui...
VLDB
2004
ACM
163views Database» more  VLDB 2004»
15 years 5 months ago
Compressing Large Boolean Matrices using Reordering Techniques
Large boolean matrices are a basic representational unit in a variety of applications, with some notable examples being interactive visualization systems, mining large graph struc...
David S. Johnson, Shankar Krishnan, Jatin Chhugani...
CORR
2004
Springer
133views Education» more  CORR 2004»
14 years 11 months ago
Information theory, multivariate dependence, and genetic network inference
We define the concept of dependence among multiple variables using maximum entropy techniques and introduce a graphical notation to denote the dependencies. Direct inference of in...
Ilya Nemenman