2413 search results - page 256 / 483 » Understanding the problem |
155
Voted
SIAMJO
2008
15 years 3 months ago
2008
Eigenvectors to the second smallest eigenvalue of the Laplace matrix of a graph, also known as Fiedler vectors, are the basic ingredient in spectral graph partitioning heuristics....
133
Voted
AIEDU
2007
15 years 3 months ago
2007
Abstract. This paper discusses the simple open student models used in two of our constraint-based tutors, SQLd KERMIT, and their effects on self-assessment. The systems present a h...
146
Voted
IJCM
2002
15 years 3 months ago
2002
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to...
159
click to vote
TON
1998
15 years 3 months ago
1998
— The configuration of virtual path (VP) connection services is expected to play an important role in the operation of large-scale asynchronous transfer mode (ATM) networks. A m...
144
click to vote
PAMI
2007
15 years 3 months ago
2007
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...