3068 search results - page 284 / 614 » Clustering with Multiple Graphs |
153
click to vote
IDMS
1998
Springer
15 years 11 months ago
1998
Springer
This position paper advocates a possible bridging of multiple heterogeneous formats and interfaces for hypermedia data and metadata. Rather than one more text, bit-stream or proced...
186
click to vote
ECCC
2006
15 years 6 months ago
2006
We present two new methods for finding a lowest common ancestor (LCA) for each pair of vertices of a directed acyclic graph (dag) on n vertices and m edges. The first method is su...
166
click to vote
ECCC
2000
15 years 6 months ago
2000
Abstract. We suggest a candidate one-way function using combinatorial constructs such as expander graphs. These graphs are used to determine a sequence of small overlapping subsets...
178
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: Clustering is a popular data exploration technique widely used in microarray data analysis. Most conventional clustering algorithms, however, generate only one set of ...
164
click to vote
GG
2004
Springer
16 years 2 days ago
2004
Springer
Abstract. Development processes in engineering disciplines are inherently complex. Throughout the development process, different kinds of inter-dependent design documents are creat...