2200 search results - page 332 / 440 » Bloch's Constant is Computable |
171
click to vote
VISSYM
2007
15 years 8 months ago
2007
We present a fast hardware-accelerated stippling method which does not require any preprocessing for placing points on surfaces. The surfaces are automatically parameterized in or...
167
click to vote
APGV
2008
ACM
15 years 8 months ago
2008
ACM
simulations compare to similar measurements done in more abstract settings. We find that participant tolerance for certain types of errors is significantly higher in a realistic sn...
210
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
202
click to vote
ECBS
2010
IEEE
15 years 8 months ago
2010
IEEE
—One of the ideas of agile software development is to respond to changes rather than following a plan. Constantly changing businesses result in changing requirements, to be handl...
158
click to vote
CCS
2008
ACM
15 years 8 months ago
2008
ACM
Low latency anonymity systems are susceptive to traffic analysis attacks. In this paper, we propose a dependent link padding scheme to protect anonymity systems from traffic analy...