5595 search results - page 742 / 1119 » Approximation Algorithms for Clustering Problems |
196
click to vote
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
Graph cut algorithms (i.e., min s-t cuts) [3][10][15] are useful in many computer vision applications. In this paper we develop a formulation that allows the addition of side cons...
166
click to vote
ICALP
2007
Springer
16 years 29 days ago
2007
Springer
In this paper, we consider the mechanism design version of the fractional variant of the scheduling problem on unrelated machines. We give a lower bound of 2 − 1/n for any fracti...
182
click to vote
SMA
2006
ACM
16 years 23 days ago
2006
ACM
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...
180
click to vote
ICAIL
2003
ACM
16 years 1 days ago
2003
ACM
Defeasible Logic is a promising representation for legal knowledge that appears to overcome many of the deficiencies of previous approaches to representing legal knowledge. Unfor...
187
click to vote
SNPD
2007
15 years 8 months ago
2007
Source and destination location privacy is a challenging and important problem in sensor networks. Nevertheless, privacy preserving communication in sensor networks is still a vir...