5606 search results - page 206 / 1122 » Randomization Techniques for Graphs. |
120
click to vote
IVC
2007
15 years 19 days ago
2007
This paper presents an optimisation technique to automatically select a set of control parameters for a Markov Random Field. The method is based on the Reactive Tabu Search strate...
107
Voted
GLOBECOM
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract—In this paper, we consider the problem of multifunctional compression with side information. The problem is how we can compress a source X so that the receiver is able t...
ACL
2006
15 years 2 months ago
2006
This paper presents techniques to apply semi-CRFs to Named Entity Recognition tasks with a tractable computational cost. Our framework can handle an NER task that has long named e...
108
click to vote
TAMC
2009
Springer
15 years 7 months ago
2009
Springer
We study a new model of computation called stream checking on graph problems where a space-limited verifier has to verify a proof sequentially (i.e., it reads the proof as a strea...
95
Voted
COLT
2005
Springer
15 years 6 months ago
2005
Springer
In recent years manifold methods have attracted a considerable amount of attention in machine learning. However most algorithms in that class may be termed “manifold-motivated...