Sciweavers

1487 search results - page 296 / 298
» Two Kinds of Metonymy
Sort
View
102
Voted
FOCS
2010
IEEE
14 years 10 months ago
The Coin Problem and Pseudorandomness for Branching Programs
The Coin Problem is the following problem: a coin is given, which lands on head with probability either 1/2 + or 1/2 - . We are given the outcome of n independent tosses of this co...
Joshua Brody, Elad Verbin
OPODIS
2010
14 years 10 months ago
An Adaptive Technique for Constructing Robust and High-Throughput Shared Objects
Abstract. Shared counters are the key to solving a variety of coordination problems on multiprocessor machines, such as barrier synchronization and index distribution. It is desire...
Danny Hendler, Shay Kutten, Erez Michalak
96
Voted
PIMRC
2010
IEEE
14 years 10 months ago
Multi-dimensional K-factor analysis for V2V radio channels in open sub-urban street crossings
In this paper we analyze the Ricean K-factor for vehicle-to-vehicle (V2V) communications in a typical open suburban street crossing. The channel conditions vary from non line-of si...
Laura Bernadó, Thomas Zemen, Johan Karedal,...
91
Voted
AMSTERDAM
2009
14 years 10 months ago
Modified Numerals as Post-Suppositions
The paper provides a compositional account of cumulative readings with non-increasing modified numerals (aka van Benthem's puzzle), e.g., Exactly three boys saw exactly five m...
Adrian Brasoveanu
AMSTERDAM
2009
14 years 10 months ago
There Is Something about Might
In this paper we present an alternative interpretation of statements of epistemic possibility, which does not induce a consistency test on a common ground, as in (Veltman 1996), bu...
Paul Dekker