2376 search results - page 429 / 476 » More Efficient Internal-Regret-Minimizing Algorithms |
157
click to vote
APPROX
2008
Springer
15 years 5 months ago
2008
Springer
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
118
click to vote
CIKM
2008
Springer
15 years 5 months ago
2008
Springer
To find near-duplicate documents, fingerprint-based paradigms such as Broder's shingling and Charikar's simhash algorithms have been recognized as effective approaches a...
125
Voted
IJCAI
1989
15 years 5 months ago
1989
Several theories of grammar currently converge toward inserting subcategorization information within lexical entries. Such a tendency would benefit from a parsing algorithm able t...
169
click to vote
BMCBI
2010
15 years 3 months ago
2010
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
162
click to vote
CONSTRAINTS
2010
15 years 3 months ago
2010
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...