2111 search results - page 136 / 423 » Understanding the Yarowsky Algorithm |
SIGCSE
2004
ACM
15 years 3 months ago
2004
ACM
This paper describes two design patterns that are powerful tools to help teach how semaphores are used to solve synchronization problems. The patterns are general enough to be use...
103
click to vote
ICDE
2010
IEEE
15 years 3 months ago
2010
IEEE
— Finding decompositions of a graph into a family of clusters is crucial to understanding its underlying structure. While most existing approaches focus on partitioning the nodes...
64
Voted
IPPS
2003
IEEE
15 years 3 months ago
2003
IEEE
The MiPPS library supports a hybrid model of parallel programming. The library is targeted at commodity multiprocessors, with support for clusters. The implementation of the concu...
GD
2009
Springer
15 years 2 months ago
2009
Springer
Canonical ordering is an important tool in planar graph drawing and other applications. Although a linear-time algorithm to determine canonical orderings has been known for a while...
KDD
1997
ACM
15 years 2 months ago
1997
ACM
A variety of techniques from statistics, signal processing, pattern recognition, machine learning, and neural networks have been proposed to understand data by discovering useful ...