2168 search results - page 100 / 434 » Randomized Algorithms and Complexity Theory |
142
click to vote
ECAI
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. The emergence of complex network structures of relationships between autonomous agents occurs in a wide range of distributed systems. Many researchers have proposed model...
147
click to vote
TON
2010
14 years 10 months ago
2010
We study the contention/interaction among wireless nodes and med -ium access control design in game theory framework. We define a general class of games, called random access game...
111
click to vote
COLT
2004
Springer
15 years 8 months ago
2004
Springer
We study the properties of the Minimum Description Length principle for sequence prediction, considering a two-part MDL estimator which is chosen from a countable class of models....
109
click to vote
SODA
2010
ACM
16 years 17 days ago
2010
ACM
We consider the complexity of sorting strings in the model that counts comparisons between symbols and not just comparisons between strings. We show that for any set of strings S ...
134
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...