2168 search results - page 55 / 434 » Randomized Algorithms and Complexity Theory |
AI
2003
Springer
15 years 8 months ago
2003
Springer
The Internet has opened opportunities for efficient on-line trading, and researchers have developed algorithms for various auctions, as well as exchanges for standardized commoditi...
121
Voted
TMC
2008
15 years 2 months ago
2008
We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a...
124
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
Depth of an object concerns a tradeoff between computation time and excess of program length over the shortest program length required to obtain the object. It gives an unconditio...
124
click to vote
ICASSP
2010
IEEE
15 years 3 months ago
2010
IEEE
Algorithms such as Least Median of Squares (LMedS) and Random Sample Consensus (RANSAC) have been very successful for low-dimensional robust regression problems. However, the comb...
139
click to vote
STACS
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...