279 search results - page 43 / 56 » Exact Algorithms for Cluster Editing: Evaluation and Experim... |
127
Voted
CVPR
2011
IEEE
14 years 5 months ago
2011
IEEE
We propose a new objective function for superpixel segmentation. This objective function consists of two components: entropy rate of a random walk on a graph and a balancing term....
113
click to vote
EMNLP
2009
14 years 11 months ago
2009
We extend previous work on fully unsupervised part-of-speech tagging. Using a non-parametric version of the HMM, called the infinite HMM (iHMM), we address the problem of choosing...
125
click to vote
KDD
2007
ACM
16 years 2 months ago
2007
ACM
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
228
click to vote
VLDB
2007
ACM
16 years 2 months ago
2007
ACM
Given a multidimensional point q, a reverse k nearest neighbor (RkNN) query retrieves all the data points that have q as one of their k nearest neighbors. Existing methods for proc...
111
click to vote
CASC
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. We propose exact, complete and efficient methods for 2 problems: First, the real solving of systems of two bivariate rational polynomials of arbitrary degree. This means ...