19866 search results - page 191 / 3974 » Computing all factorizations in *** |
155
click to vote
PAM
2012
Springer
14 years 2 months ago
2012
Springer
Abstract. This paper presents a first look at long-term delay measurements from data connections in 3 Norwegian 3G Networks. We have performed active measurements for more than 6 ...
179
click to vote
SIAMCOMP
2010
15 years 5 months ago
2010
The classical direct product theorem for circuits says that if a Boolean function f : {0, 1}n → {0, 1} is somewhat hard to compute on average by small circuits, then the correspo...
153
click to vote
ICCD
2001
IEEE
16 years 3 months ago
2001
IEEE
Classical floorplanning minimizes a linear combination of area and wirelength. When Simulated Annealing is used, e.g., with the Sequence Pair representation, the typical choice o...
172
click to vote
ASIACRYPT
2009
Springer
16 years 1 months ago
2009
Springer
We present a new construction of non-committing encryption schemes. Unlike the previous constructions of Canetti et al. (STOC ’96) and of Damg˚ard and Nielsen (Crypto ’00), ou...
163
click to vote
IUI
2006
ACM
16 years 15 days ago
2006
ACM
In this paper we present a novel system for monitoring a computer user’s posture and activities in front of the computer (e.g., reading, speaking on the phone, etc.) for self-re...