243 search results - page 19 / 49 » On randomized representations of graphs using short labels |
118
click to vote
NIPS
2004
15 years 3 months ago
2004
We consider the problem of structured classification, where the task is to predict a label y from an input x, and y has meaningful internal structure. Our framework includes super...
100
click to vote
NAACL
2010
14 years 11 months ago
2010
We suggest improvements to a previously proposed framework for integrating Conditional Random Fields and Hidden Markov Models, dubbed a Crandem system (2009). The previous authors...
125
Voted
DAGM
2008
Springer
15 years 3 months ago
2008
Springer
The design of inference algorithms for discrete-valued Markov Random Fields constitutes an ongoing research topic in computer vision. Large state-spaces, none-submodular energy-fun...
120
Voted
EJC
2006
15 years 1 months ago
2006
We find the asymptotic number of connected graphs with k vertices and k - 1 + l edges when k, l approach infinity, reproving a result of Bender, Canfield and McKay. We use the pro...
128
Voted
ECCV
2004
Springer
16 years 3 months ago
2004
Springer
In recent work, we presented a framework for many-to-many matching of multi-scale feature hierarchies, in which features and their relations were captured in a vertex-labeled, edge...