534 search results - page 3 / 107 » One more bit is enough |
215
Voted
IWMM
1998
Springer
15 years 11 months ago
1998
Springer
Stoye's one-bit reference tagging scheme can be extended to local counts of two or more via two strategies. The first, suited to pure register transactions, is a cache of ref...
178
Voted
NAACL
2010
15 years 5 months ago
2010
Deploying an automatic speech recognition system with reasonable performance requires expensive and time-consuming in-domain transcription. Previous work demonstrated that non-pro...
213
Voted
WMTE
2005
IEEE
16 years 28 days ago
2005
IEEE
: There is an ever growing number of mobile learning applications based on location-awareness, However, there is still a lack of information concerning how it might impact socio-co...
161
Voted
CRYPTO
2003
Springer
16 years 17 days ago
2003
Springer
On August 2002, Agrawal, Kayal and Saxena announced the first deterministic and polynomial time primality testing algorithm. For an input n, the AKS algorithm runs in heuristic t...
198
click to vote
ICALP
2007
Springer
16 years 1 months ago
2007
Springer
This paper studies the gap between classical one-way communication complexity C(f) and its quantum counterpart Q(f), under the unbounded-error setting, i.e., it is enough that the ...