4037 search results - page 573 / 808 » Routing without ordering |
145
click to vote
PPOPP
1993
ACM
15 years 8 months ago
1993
ACM
A vast body of theoretical research has focused either on overly simplistic models of parallel computation, notably the PRAM, or overly specific models that have few representati...
152
click to vote
AFRIGRAPH
2009
ACM
15 years 8 months ago
2009
ACM
Traditionally, levels of detail (LOD) for animated characters are computed from a single pose. Later techniques refined this approach by considering a set of sample poses and eval...
132
click to vote
IPMU
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Credal sets are closed convex sets of probability mass functions. The lower probabilities specified by a credal set for each element of the power set can be used as cons...
149
click to vote
PKC
2010
Springer
15 years 8 months ago
2010
Springer
We propose new and improved instantiations of lossy trapdoor functions (Peikert and Waters, STOC ’08), and correlation-secure trapdoor functions (Rosen and Segev, TCC ’09). Ou...
150
click to vote
DAC
2007
ACM
15 years 8 months ago
2007
ACM
While cryptographic algorithms are usually strong against mathematical attacks, their practical implementation, both in software and in hardware, opens the door to side-channel at...