2354 search results - page 385 / 471 » Randomness, Stochasticity and Approximations |
174
click to vote
STACS
2005
Springer
15 years 11 months ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
167
click to vote
ESA
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
161
click to vote
NIPS
2007
15 years 7 months ago
2007
The problem of obtaining the maximum a posteriori estimate of a general discrete random field (i.e. a random field defined using a finite and discrete set of labels) is known ...
163
click to vote
SODA
2003
ACM
15 years 7 months ago
2003
ACM
We consider the problem of finding efficient trees to send information from k sources to a single sink in a network where information can be aggregated at intermediate nodes in t...
183
click to vote
SODA
2003
ACM
15 years 7 months ago
2003
ACM
In a recent paper, Ajtai et al. [1] give a streaming algorithm to count the number of inversions in a stream Ä ¾ Ñ Ò using two passes and Ç´¯ ½ ÔÒÐÓ Ò´ÐÓ Ñ·ÐÓ...