2111 search results - page 56 / 423 » Understanding the Yarowsky Algorithm |
PAMI
2007
13 years 10 months ago
2007
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
COMPSAC
2005
IEEE
14 years 4 months ago
2005
IEEE
Maintenance is a time consuming activity within software development and it requires a good understanding of the system in question. It is hard or even impossible to understand po...
IEEECIT
2009
IEEE
14 years 5 months ago
2009
IEEE
—Software clustering is a method for increasing software system understanding and maintenance. Software designers, first use MDG graph to model the structure of software system. ...
PLDI
2006
ACM
14 years 4 months ago
2006
ACM
Constructing correct concurrent garbage collection algorithms is notoriously hard. Numerous such algorithms have been proposed, implemented, and deployed – and yet the relations...
BERTINORO
2005
Springer
14 years 4 months ago
2005
Springer
Decentralized peer to peer (p2p) networks like Gnutella are attractive for certain applications because they require no centralized directories and no precise control over network ...