1140 search results - page 45 / 228 » Progress on Certifying Algorithms |
82
Voted
RP
2010
Springer
14 years 10 months ago
2010
Springer
Chrobak (1986) proved that a language accepted by a given nondeterministic finite automaton with one-letter alphabet, i.e., a unary NFA, with n states can be represented as the uni...
99
Voted
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
Matrix optimization with orthogonal constraints appear in a variety of application fields including signal and image processing. Several researchers have developed algorithms for...
119
Voted
DAM
2008
15 years 18 days ago
2008
Polar graphs are a common generalization of bipartite, cobipartite, and split graphs. They are defined by the existence of a certain partition of vertices, which is NPcomplete to ...
128
click to vote
AAAI
2012
13 years 2 months ago
2012
Significant progress has been made recently in the following two lines of research in the intersection of AI and game theory: (1) the computation of optimal strategies to commit ...
98
Voted
ICAPR
2005
Springer
15 years 6 months ago
2005
Springer
The RW algorithm has been proposed recently to solve the exact graph matching problem. This algorithm exploits Random Walk theory to compute a topological signature which can be u...