1301 search results - page 105 / 261 » Bounded Version Vectors |
111
click to vote
DM
2010
15 years 25 days ago
2010
In the online F-avoidance edge-coloring game with r colors, a graph on n vertices is generated by at each stage randomly adding a new edge. The player must color each new edge as ...
71
Voted
CORR
2006
Springer
15 years 24 days ago
2006
Springer
The Minimum Description Length principle for online sequence estimation/prediction in a proper learning setup is studied. If the underlying model class is discrete, then the total...
115
Voted
DATAMINE
2006
15 years 24 days ago
2006
Motivated by the poor performance (linear complexity) of the EM algorithm in clustering large data sets, and inspired by the successful accelerated versions of related algorithms l...
95
Voted
CORR
2007
Springer
15 years 22 days ago
2007
Springer
Universally achievable error exponents pertaining to certain families of channels (most notably, discrete memoryless channels (DMC’s)), and various ensembles of random codes, ar...
145
click to vote
NFM
2011
14 years 7 months ago
2011
A main idea underlying bounded model checking is to limit the length of the potential counter-examples, and then prove properties for the bounded version of the problem. In softwar...