2446 search results - page 395 / 490 » Choiceless Polynomial Time |
149
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
192
click to vote
PAMI
2012
13 years 6 months ago
2012
— Language and image understanding are two major goals of artificial intelligence which can both be conceptually formulated in terms of parsing the input signal into a hierarchi...
173
click to vote
SODA
2012
ACM
13 years 6 months ago
2012
ACM
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
189
click to vote
ESA
2007
Springer
15 years 8 months ago
2007
Springer
We consider the price of selfish routing in terms of tradeoffs and from an average-case perspective. Each player in a network game seeks to send a message with a certain length by...
152
click to vote
COLT
2006
Springer
15 years 8 months ago
2006
Springer
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...