Sciweavers

109 search results - page 19 / 22
» Straight-Line Drawing Algorithms for Hierarchical Graphs and...
Sort
View
ICALP
2005
Springer
14 years 1 months ago
Computational Bounds on Hierarchical Data Processing with Applications to Information Security
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
Roberto Tamassia, Nikos Triandopoulos
NIPS
2001
13 years 9 months ago
Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering
Drawing on the correspondence between the graph Laplacian, the Laplace-Beltrami operator on a manifold, and the connections to the heat equation, we propose a geometrically motiva...
Mikhail Belkin, Partha Niyogi
WISE
2009
Springer
14 years 4 months ago
Formal Identification of Right-Grained Services for Service-Oriented Modeling
Identifying the right-grained services is important to lead the successful service orientation because it has a direct impact on two major goals: the composability of loosely-coupl...
Yukyong Kim, Kyung-Goo Doh
ICMCS
2007
IEEE
107views Multimedia» more  ICMCS 2007»
14 years 1 months ago
Finding Image Structure by Hierarchal Segmentation
Image segmentation has been studied for many years. But what factors influence segmentation results indeed? Why some images are easy to be handled while the others are not? In thi...
Bo Qiu, Daniel Racoceanu
BMCBI
2010
143views more  BMCBI 2010»
13 years 7 months ago
ETE: a python Environment for Tree Exploration
Background: Many bioinformatics analyses, ranging from gene clustering to phylogenetics, produce hierarchical trees as their main result. These are used to represent the relations...
Jaime Huerta-Cepas, Joaquín Dopazo, Toni Ga...