2314 search results - page 430 / 463 » Minimal Partitions of a Graph |
DIALM
2008
ACM
15 years 2 months ago
2008
ACM
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
137
Voted
ECAI
2008
Springer
15 years 2 months ago
2008
Springer
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
94
Voted
CCCG
2007
15 years 2 months ago
2007
In this paper, we introduce a generalized version of the Watchman Route Problem (WRP) where the objective is to plan a continuous closed route in a polygon (possibly with holes) a...
100
Voted
IPCO
2010
15 years 2 months ago
2010
In the Steiner Network problem we are given a graph with edge-costs and connectivity requirements between node pairs , . The goal is to find a minimum-cost subgraph of that contain...
109
click to vote
SDM
2010
SIAM
15 years 2 months ago
2010
SIAM
We present a method for unsupervised discovery of abnormal occurrences of activities in multi-dimensional time series data. Unsupervised activity discovery approaches differ from ...