350 search results - page 12 / 70 » Separation of Partition Inequalities |
STOC
2004
ACM
14 years 8 months ago
2004
ACM
In this paper, we address two longstanding questions about finding good separators in graphs of bounded genus and degree:
JMLR
2010
13 years 2 months ago
2010
Hartigan's method for k-means clustering is the following greedy heuristic: select a point, and optimally reassign it. This paper develops two other formulations of the heuri...
DEXA
2004
Springer
14 years 1 months ago
2004
Springer
: In this paper, we will propose PC-Filter (PC stands for Partition Comparison), a robust data filter for approximately duplicate record detection in large databases. PC-Filter dis...
DAM
2000
13 years 7 months ago
2000
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
CSCW
2006
ACM
13 years 8 months ago
2006
ACM
Healthcare organizations are often organized in a modular, loosely coupled fashion where separate and semi-autonomous work units specialize in different areas of care delivery. Thi...