12015 search results - page 427 / 2403 » Interactive Algorithms 2005 |
145
click to vote
ICAPR
2005
Springer
15 years 10 months ago
2005
Springer
The RW algorithm has been proposed recently to solve the exact graph matching problem. This algorithm exploits Random Walk theory to compute a topological signature which can be u...
137
click to vote
WAOA
2005
Springer
15 years 10 months ago
2005
Springer
MAX SAT and MAX NAE-SAT are central problems in theoretical computer science. We present an approximation algorithm for MAX NAE-SAT with a conjectured performance guarantee of 0.82...
157
click to vote
BVAI
2005
Springer
15 years 10 months ago
2005
Springer
We propose an algorithm that groups points similarly to how human observers do. It is simple, totally unsupervised and able to find clusters of complex and not necessarily convex s...
121
click to vote
IJCNLP
2005
Springer
15 years 10 months ago
2005
Springer
Document clustering has many uses in natural language tools and applications. For instance, summarizing sets of documents that all describe the same event requires first identifyi...
144
click to vote
CVPR
2005
IEEE
16 years 6 months ago
2005
IEEE
We present a quantitative evaluation of SE-MinCut, a novel segmentation algorithm based on spectral embedding and minimum cut. We use human segmentations from the Berkeley Segment...