187 search results - page 28 / 38 » On the Natural Imprint Function of a Graph |
174
click to vote
CIAC
2010
Springer
16 years 3 months ago
2010
Springer
In this paper we consider a natural generalization of the well-known Max Leaf
Spanning Tree problem. In the generalized Weighted Max Leaf problem we get as
input an undirected co...
185
click to vote
KDD
2010
ACM
15 years 9 months ago
2010
ACM
Constrained clustering has been well-studied for algorithms like K-means and hierarchical agglomerative clustering. However, how to encode constraints into spectral clustering rem...
162
click to vote
AFRIGRAPH
2001
ACM
15 years 9 months ago
2001
ACM
This article presents a gesture detection and analysis framework for modelling multimodal interactions. It is particulary designed for its use in Virtual Reality (VR) applications...
177
click to vote
UML
2000
Springer
15 years 9 months ago
2000
Springer
Software testing can only be formalized and quanti ed when a solid basis for test generation can be de ned. Tests are commonly generated from program source code, graphical models ...
156
click to vote
TCS
1998
15 years 5 months ago
1998
![Threshold Dominating Sets and an Improved Characterization of W[2]](https://sciweavers.org/files/imagecache/thumbnail/imagecache/threshold_dominating_sets_and_an_improved_characterization_of_w_2_TCS_1998.jpg "Threshold Dominating Sets and an Improved Characterization of W[2]")
The Threshold Dominating Set problem is that of determining for a graph G = (V, E) whether there is a subset V ⊆ V of size k, such that for each vertex v ∈ V there are at leas...