Sciweavers

236 search results - page 29 / 48
» Structural differences between two graphs through hierarchie...
Sort
View
APVIS
2007
13 years 10 months ago
A comparison of vertex ordering algorithms for large graph visualization
In this study, we examine the use of graph ordering algorithms for visual analysis of data sets using visual similarity matrices. Visual similarity matrices display the relationsh...
Christopher Mueller, Benjamin Martin, Andrew Lumsd...
ICASSP
2011
IEEE
13 years 10 days ago
Improved spoken term detection with graph-based re-ranking in feature space
This paper presents a graph-based approach for spoken term detection. Each first-pass retrieved utterance is a node on a graph and the edge between two nodes is weighted by the s...
Yun-Nung Chen, Chia-Ping Chen, Hung-yi Lee, Chun-a...
ER
2006
Springer
112views Database» more  ER 2006»
14 years 8 days ago
A DAG Comparison Algorithm and Its Application to Temporal Data Warehousing
Abstract. We present a new technique for discovering and representing structural changes between two versions of a directed acyclic graph (DAG). Motivated by the necessity of chang...
Johann Eder, Karl Wiggisser
ECOOP
2005
Springer
14 years 2 months ago
Prototypes with Multiple Dispatch: An Expressive and Dynamic Object Model
Two object-oriented programming language paradigms— dynamic, prototype-based languages and multi-method languages— provide orthogonal benefits to software engineers. These two...
Lee Salzman, Jonathan Aldrich
PR
2008
169views more  PR 2008»
13 years 8 months ago
A survey of kernel and spectral methods for clustering
Clustering algorithms are a useful tool to explore data structures and have been employed in many disciplines. The focus of this paper is the partitioning clustering problem with ...
Maurizio Filippone, Francesco Camastra, Francesco ...