Sciweavers

64 search results - page 12 / 13
» Number of Maximal Partial Clones
Sort
View
GD
2003
Springer
13 years 11 months ago
Fixed-Location Circular-Arc Drawing of Planar Graphs
In this paper we consider the problem of drawing a planar graph using circular arcs as edges, given a one-to-one mapping between the vertices of the graph and a set of points in t...
Alon Efrat, Cesim Erten, Stephen G. Kobourov
KDD
2007
ACM
249views Data Mining» more  KDD 2007»
14 years 6 months ago
The minimum consistent subset cover problem and its applications in data mining
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
Byron J. Gao, Martin Ester, Jin-yi Cai, Oliver Sch...
DSN
2007
IEEE
14 years 10 days ago
Electing an Eventual Leader in an Asynchronous Shared Memory System
This paper considers the problem of electing an eventual leader in an asynchronous shared memory system. While this problem has received a lot of attention in messagepassing syste...
Antonio Fernández, Ernesto Jiménez, ...
AI
1999
Springer
13 years 5 months ago
Coalition Structure Generation with Worst Case Guarantees
Coalition formation is a key topic in multiagent systems. One may prefer a coalition structure that maximizes the sum of the values of the coalitions, but often the number of coal...
Tuomas Sandholm, Kate Larson, Martin Andersson, On...
IPPS
2007
IEEE
14 years 9 days ago
Formal Analysis for Debugging and Performance Optimization of MPI
High-end computing is universally recognized to be a strategic tool for leadership in science and technology. A significant portion of high-end computing is conducted on clusters...
Ganesh Gopalakrishnan, Robert M. Kirby