5153 search results - page 181 / 1031 » Introduction to Randomized Algorithms |
125
click to vote
SODA
2004
ACM
15 years 4 months ago
2004
ACM
We are given a collection of m random subsequences (traces) of a string t of length n where each trace is obtained by deleting each bit in the string with probability q. Our goal ...
158
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Predicting the occurrence of links is a fundamental problem in networks. In the link prediction problem we are given a snapshot of a network and would like to infer which interact...
123
click to vote
ECCC
2000
15 years 2 months ago
2000
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
136
click to vote
IVC
2007
15 years 2 months 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...
133
click to vote
KDD
2009
ACM
16 years 3 months ago
2009
ACM
Conditional random fields(CRFs) are a class of undirected graphical models which have been widely used for classifying and labeling sequence data. The training of CRFs is typicall...