2095 search results - page 152 / 419 » Improved pebbling bounds |
145
click to vote
ICITS
2009
15 years 4 months ago
2009
Abstract. The term indistinguishability amplification refers to a setting where a certain construction combines two (or more) cryptographic primitives of the same type to improve t...
226
click to vote
COMBINATORICA
2010
15 years 1 months ago
2010
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
152
click to vote
ICC
2008
IEEE
16 years 28 days ago
2008
IEEE
—An improved SINR metric is proposed for the random beamforming scheme introduced by Sharif and Hassibi, when the channel observation used to compute the SINR is known to be nois...
193
click to vote
IBPRIA
2003
Springer
15 years 11 months ago
2003
Springer
A procedure for automatic mosaic construction over long image sequences is presented. This mosaic is used by an underwater vehicle to estimate its motion with respect to the ocean ...
163
click to vote
FCT
2007
Springer
15 years 10 months ago
2007
Springer
The theorem of factorisation forests shows the existence of nested factorisations -- a la Ramsey -- for finite words. This theorem has important applications in semigroup theory, a...