1064 search results - page 116 / 213 » Single Tree Grammars |
151
Voted
IPCO
2010
15 years 1 months ago
2010
We present a branch-and-bound algorithm for minimizing a convex quadratic objective function over integer variables subject to convex constraints. In a given node of the enumerati...
147
Voted
NIPS
2008
15 years 5 months ago
2008
We introduce a new interpretation of multiscale random fields (MSRFs) that admits efficient optimization in the framework of regular (single level) random fields (RFs). It is base...
144
Voted
DCOSS
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
159
Voted
UMUAI
1998
15 years 3 months ago
1998
A modeling system may be required to predict an agent’s future actions under constraints of inadequate or contradictory relevant historical evidence. This can result in low predi...
154
Voted
KDD
2012
ACM
13 years 6 months ago
2012
ACM
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...