1449 search results - page 45 / 290 » Self-Randomized Exponentiation Algorithms |
STOC
2004
ACM
16 years 25 days ago
2004
ACM
The perceptron algorithm, developed mainly in the machine learning literature, is a simple greedy method for finding a feasible solution to a linear program (alternatively, for le...
107
Voted
CAV
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. A recent approach to automated assume-guarantee reasoning (AGR) for concurrent systems relies on computing environment assumptions for components using the L algorithm fo...
AAAI
2008
15 years 2 months ago
2008
Conditional random field (CRF) is a popular graphical model for sequence labeling. The flexibility of CRF poses significant computational challenges for training. Using existing o...
121
Voted
CORR
2012
Springer
13 years 8 months ago
2012
Springer
The notions of subgraph centrality and communicability, based on the exponential of the adjacency matrix of the underlying graph, have been effectively used in the analysis of und...
197
click to vote
AUSSOIS
2001
Springer
15 years 5 months ago
2001
Springer
We discuss fast exponential time solutions for NP-complete problems. We survey known results and approaches, we provide pointers to the literature, and we discuss several open prob...