356 search results - page 60 / 72 » Parallelizing time with polynomial circuits |
COMPGEOM
1993
ACM
14 years 5 hour ago
1993
ACM
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...
ASAP
2002
IEEE
14 years 26 days ago
2002
IEEE
With the growth of the Internet and mobile communication industry, multimedia applications form a dominant computer workload. Media workloads are typically executed on Application...
MTDT
2003
IEEE
14 years 1 months ago
2003
IEEE
Memory cores (especially SRAM cores) used on a system chip usually come from a memory compiler. Commercial memory compilers have their limitation— a large memory may need to be ...
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
Next-generation e-Science applications will require the ability to transfer information at high data rates between distributed computing centers and data repositories. To support ...
EUROCRYPT
2003
Springer
14 years 1 months ago
2003
Springer
A new public-key model for resettable zero-knowledge (rZK) protocols, which is an extension and generalization of the upper-bounded public-key (UPK) model introduced by Micali and ...