Sciweavers

2767 search results - page 116 / 554
» Universal Exponentiation Algorithm
Sort
View
CAV
2007
Springer
164views Hardware» more  CAV 2007»
15 years 2 months ago
SAT-Based Compositional Verification Using Lazy Learning
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...
Nishant Sinha, Edmund M. Clarke
AAAI
2008
15 years 9 days ago
CRF-OPT: An Efficient High-Quality Conditional Random Field Solver
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...
Minmin Chen, Yixin Chen, Michael R. Brent
CORR
2012
Springer
195views Education» more  CORR 2012»
13 years 5 months ago
Ranking hubs and authorities using matrix functions
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...
Michele Benzi, Ernesto Estrada, Christine Klymko
ECIR
2010
Springer
14 years 8 months ago
Maximum Margin Ranking Algorithms for Information Retrieval
Abstract. Machine learning ranking methods are increasingly applied to ranking tasks in information retrieval (IR). However ranking tasks in IR often differ from standard ranking t...
Shivani Agarwal, Michael Collins
STOC
2009
ACM
123views Algorithms» more  STOC 2009»
15 years 10 months ago
An improved constant-time approximation algorithm for maximum~matchings
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
Yuichi Yoshida, Masaki Yamamoto, Hiro Ito