Sciweavers

565 search results - page 31 / 113
» Geometry of Upper Probabilities
Sort
View
CORR
2008
Springer
189views Education» more  CORR 2008»
13 years 7 months ago
Algorithms for Dynamic Spectrum Access with Learning for Cognitive Radio
We study the problem of dynamic spectrum sensing and access in cognitive radio systems as a partially observed Markov decision process (POMDP). A group of cognitive users cooperati...
Jayakrishnan Unnikrishnan, Venugopal V. Veeravalli
TWC
2010
13 years 2 months ago
Random access transport capacity
Abstract--We develop a new metric for quantifying end-toend throughput in multihop wireless networks, which we term random access transport capacity, since the interference model p...
Jeffrey G. Andrews, Steven Weber, Marios Kountouri...
RANDOM
1998
Springer
13 years 11 months ago
"Balls into Bins" - A Simple and Tight Analysis
Suppose we sequentially throw m balls into n bins. It is a natural question to ask for the maximum number of balls in any bin. In this paper we shall derive sharp upper and lower b...
Martin Raab, Angelika Steger
SODA
2010
ACM
238views Algorithms» more  SODA 2010»
14 years 5 months ago
How good is the Chord algorithm?
The Chord algorithm is a popular, simple method for the succinct approximation of curves, which is widely used, under different names, in a variety of areas, such as, multiobjecti...
Constantinos Daskalakis, Ilias Diakonikolas, Mihal...
DGCI
2009
Springer
14 years 2 months ago
Multivariate Watershed Segmentation of Compositional Data
Abstract. Watershed segmentation of spectral images is typically achieved by first transforming the high-dimensional input data into a scalar boundary indicator map which is used ...
Michael Hanselmann, Ullrich Köthe, Bernhard Y...