2168 search results - page 261 / 434 » Randomized Algorithms and Complexity Theory |
144
Voted
WAW
2007
Springer
15 years 9 months ago
2007
Springer
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently th...
148
click to vote
ICMCS
2000
IEEE
15 years 8 months ago
2000
IEEE
: In the process of transmission of digital encoded video bit streams over physical network, the data is corrupted by random bit errors, which has a several effect on the decoded v...
125
Voted
FOCS
1995
IEEE
15 years 7 months ago
1995
IEEE
Abstract. Littlestone developed a simple deterministic on-line learning algorithm for learning k-literal disjunctions. This algorithm (called Winnow) keeps one weight for each of t...
225
Voted
TOPLAS
2008
15 years 3 months ago
2008
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
138
Voted
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
An important aspect of mechanism design in social choice protocols and multiagent systems is to discourage insincere and manipulative behaviour. We examine the computational compl...