Sciweavers

3396 search results - page 417 / 680
» Tree representations of graphs
Sort
View
ISBI
2011
IEEE
14 years 10 months ago
Sparse Riemannian manifold clustering for HARDI segmentation
We address the problem of segmenting high angular resolution diffusion images of the brain into cerebral regions corresponding to distinct white matter fiber bundles. We cast thi...
Hasan Ertan Çetingül, René Vida...
ISBRA
2009
Springer
16 years 1 months ago
Querying Protein-Protein Interaction Networks
Recent techniques increase the amount of our knowledge of interactions between proteins. To filter, interpret and organize this data, many authors have provided tools for querying...
Guillaume Blin, Florian Sikora, Stéphane Vi...
APPROX
2009
Springer
104views Algorithms» more  APPROX 2009»
16 years 1 months ago
Improved Polynomial Identity Testing for Read-Once Formulas
An arithmetic read-once formula (ROF for short) is a formula (a circuit whose underlying graph is a tree) in which the operations are {+, ×} and such that every input variable la...
Amir Shpilka, Ilya Volkovich
SIGCSE
1998
ACM
107views Education» more  SIGCSE 1998»
15 years 11 months ago
Web-based animation of data structures using JAWAA
JAWAA is a simple command language for creating animations of data structures and displaying them with a Web browser. Commands are stored in a script file that is retrieved and r...
Willard C. Pierson, Susan H. Rodger
IPMU
1994
Springer
15 years 10 months ago
Philosophical Foundations for Causal Networks
Bayes nets are seeing increasing use in expert systems [2, 6], and structural equations models continue to be popular in many branches of the social sciences [1]. Both types of mod...
Glenn Shafer