9842 search results - page 1386 / 1969 » The Complexity of the Matching-Cut Problem |
168
click to vote
COMPGEOM
2004
ACM
16 years 19 days ago
2004
ACM
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
171
click to vote
COMPGEOM
2004
ACM
16 years 19 days ago
2004
ACM
We prove that the lines tangent to four possibly intersecting convex polyhedra in 3 with n edges in total form Θ(n2 ) connected components in the worst case. In the generic ca...
217
click to vote
MOBICOM
2004
ACM
16 years 18 days ago
2004
ACM
A newly deployed multi-hop radio network is unstructured and lacks a reliable and efficient communication scheme. In this paper, we take a step towards analyzing the problems exis...
177
click to vote
SIGECOM
2004
ACM
16 years 18 days ago
2004
ACM
We consider the parallels between the preference elicitation problem in combinatorial auctions and the problem of learning an unknown function from learning theory. We show that l...
187
click to vote
DEXA
2004
Springer
16 years 17 days 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...