2111 search results - page 114 / 423 » Understanding the Yarowsky Algorithm |
CVPR
2012
IEEE
13 years 10 days ago
2012
IEEE
Supervoxel segmentation has strong potential to be incorporated into early video analysis as superpixel segmentation has in image analysis. However, there are many plausible super...
RECOMB
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. The understanding of genome rearrangements is an important endeavor in comparative genomics. A major computational problem in this field is finding a shortest sequence of...
STOC
2004
ACM
15 years 10 months ago
2004
ACM
The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hype...
AIPR
2007
IEEE
15 years 4 months ago
2007
IEEE
A common way to evaluate the performance of a system is to compare the algorithmic outputs with ground truth to identify divergences in the system’s performance and discover the...
ACMSE
2005
ACM
15 years 3 months ago
2005
ACM
Recent research suggests that most of the real-world random networks organize themselves into communities. Communities are formed by subsets of nodes in a graph, which are closely...