1952 search results - page 353 / 391 » Complete partitions of graphs |
132
click to vote
APPROX
2004
Springer
15 years 9 months ago
2004
Springer
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
130
click to vote
KR
2004
Springer
15 years 9 months ago
2004
Springer
This paper deals with preference representation and elicitation in the context of multiattribute utility theory under risk. Assuming the decision maker behaves according to the EU...
145
click to vote
COLT
2003
Springer
15 years 9 months ago
2003
Springer
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...
131
click to vote
ESWS
2010
Springer
15 years 9 months ago
2010
Springer
The performance of triple stores is one of the major obstacles for the deployment of semantic technologies in many usage scenarios. In particular, Semantic Web applications, which ...
141
click to vote
GEOS
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. Often the information present in a spatial knowledge base is represented at a different level of granularity and abstraction than the query constraints. For querying onto...