Sciweavers

352 search results - page 47 / 71
» Partitioning Graphs into Connected Parts
Sort
View
ICASSP
2009
IEEE
15 years 6 months ago
Exploiting T-junctions for depth segregation in single images
Occlusion is one of the major consequences of the physical image generation process: it occurs when an opaque object partly obscures the view of another object further away from t...
Mariella Dimiccoli, Philippe Salembier
85
Voted
BMCBI
2008
96views more  BMCBI 2008»
14 years 12 months ago
Novel methodology for construction and pruning of quasi-median networks
Background: Visualising the evolutionary history of a set of sequences is a challenge for molecular phylogenetics. One approach is to use undirected graphs, such as median network...
Sarah C. Ayling, Terence A. Brown
WWW
2011
ACM
14 years 6 months ago
OntoTrix: a hybrid visualization for populated ontologies
Most Semantic Web data visualization tools structure the representation according to the concept definitions and interrelations that constitute the ontology’s vocabulary. Insta...
Benjamin Bach, Emmanuel Pietriga, Ilaria Liccardi,...
IPPS
2006
IEEE
15 years 5 months ago
Saburo, a tool for I/O and concurrency management in servers
This paper presents a Java framework based on separation of concerns and code generation concepts that facilitates development of concurrency and I/O in servers. In this approach,...
Gautier Loyauté, Rémi Forax, Gilles ...
STACS
2007
Springer
15 years 5 months ago
Testing Convexity Properties of Tree Colorings
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
Eldar Fischer, Orly Yahalom