380 search results - page 41 / 76 » Cluster Graphs as Abstractions for Constraint Satisfaction P... |
108
click to vote
FSTTCS
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. We propose a novel approach to clustering, based on deterministic analysis of random walks on the weighted graph associated with the clustering problem. The method is cen...
108
click to vote
NIPS
2004
15 years 1 months ago
2004
Various problems in machine learning, databases, and statistics involve pairwise distances among a set of objects. It is often desirable for these distances to satisfy the propert...
109
click to vote
INFOCOM
2006
IEEE
15 years 5 months ago
2006
IEEE
nts etc.), an abstract graph of the deployment area and QoS constraints to generate appropriate logical topologies. WIND starts with the set of network elements to be deployed (Nod...
109
click to vote
IJCAI
2003
15 years 1 months ago
2003
In [Jegou, 1993], a decomposition method has been introduced for improving search efficiency in the area of Constraint Satisfaction Problems. This method is based on properties of...
IWPC
2000
IEEE
15 years 4 months ago
2000
IEEE
This paper presents a framework for software architecture recovery and restructuring. The user specifies a high level abstraction view of the system using a structured pattern la...