Sciweavers

521 search results - page 48 / 105
» Coring method for clustering a graph
Sort
View
TLDI
2009
ACM
142views Formal Methods» more  TLDI 2009»
16 years 1 months ago
Static extraction of sound hierarchical runtime object graphs
For many object-oriented systems, it is often useful to have a runtime architecture that shows networks of communicating objects. But it is hard to statically extract runtime obje...
Marwan Abi-Antoun, Jonathan Aldrich
FIMH
2009
Springer
15 years 11 months ago
Cardiac Fibre Trace Clustering for the Interpretation of the Human Heart Architecture
Cardiac fibre architecture plays a key role in heart function. Recently, the estimation of fibre structure has been simplified with diffusion tensor MRI (DT-MRI). In order to as...
Carole Frindel, Marc C. Robini, Joël Schaerer...
KDD
2005
ACM
127views Data Mining» more  KDD 2005»
15 years 10 months ago
Mining closed relational graphs with connectivity constraints
Relational graphs are widely used in modeling large scale networks such as biological networks and social networks. In this kind of graph, connectivity becomes critical in identif...
Xifeng Yan, Xianghong Jasmine Zhou, Jiawei Han
WSE
2003
IEEE
15 years 9 months ago
Using Keyword Extraction for Web Site Clustering
Reverse engineering techniques have the potential to support Web site understanding, by providing views that show the organization of a site and its navigational structure. Howeve...
Paolo Tonella, Filippo Ricca, Emanuele Pianta, Chr...
MFCS
1997
Springer
15 years 8 months ago
Resolution Proofs, Exponential Bounds, and Kolmogorov Complexity
We prove an exponential lower bound for the length of any resolution proof for the same set of clauses as the one used by Urquhart [13]. Our contribution is a significant simpli...
Uwe Schöning