2111 search results - page 44 / 423 » Understanding the Yarowsky Algorithm |
85
Voted
WG
2007
Springer
15 years 6 months ago
2007
Springer
NLC-width is a variant of clique-width with many application in graph algorithmic. This paper is devoted to graphs of NLC-width two. After giving new structural properties of the ...
100
Voted
UIST
2006
ACM
15 years 6 months ago
2006
ACM
NP-hard combinatorial optimization problems are common in real life. Due to their intractability, local search algorithms are often used to solve such problems. Since these algori...
62
Voted
ICIP
2002
IEEE
16 years 2 months ago
2002
IEEE
The state of the art for solving the phase retrieval problem in two dimensions relies heavily on the algorithms proposed by Gerchberg, Saxton, and Fienup. Despite the widespread u...
113
Voted
FCS
2006
15 years 1 months ago
2006
: In this paper, functioning and interaction of distributed devices and concurrent algorithms are analyzed in the context of the theory of algorithms. Although different systems in...
CATS
2008
15 years 1 months ago
2008
Lock-free algorithms have been developed to avoid various problems associated with using locks to control access to shared data structures. These algorithms are typically more int...