7015 search results - page 97 / 1403 » Approximation algorithms for co-clustering |
EACL
2009
ACL Anthology
14 years 9 months ago
2009
ACL Anthology
IPPS
1998
IEEE
14 years 1 months ago
1998
IEEE
We present a rst randomized Ologk n time and On+m work CRCWPRAM algorithm for nding a spanning forest of an undirected dense graph with n vertices. Furthermore we construct a rando...
ECML
2006
Springer
14 years 26 days ago
2006
Springer
We present a new class of perceptron-like algorithms with margin in which the "effective" learning rate, defined as the ratio of the learning rate to the length of the we...
AAAI
2010
13 years 9 months ago
2010
Many computational problems in game theory, such as finding Nash equilibria, are algorithmically hard to solve. This limitation forces analysts to limit attention to restricted su...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
This paper introduces a new algorithm for solving a subclass of quantified constraint satisfaction problems (QCSP) where existential quantifiers precede universally quantified ine...