Sciweavers

9997 search results - page 351 / 2000
» The case for crowd computing
Sort
View
TCC
2004
Springer
147views Cryptology» more  TCC 2004»
16 years 2 days ago
Computational Collapse of Quantum State with Application to Oblivious Transfer
Quantum 2-party cryptography differs from its classical counterpart in at least one important way: Given blak-box access to a perfect commitment scheme there exists a secure 1−2...
Claude Crépeau, Paul Dumais, Dominic Mayers...
ACSC
2003
IEEE
16 years 23 hour ago
Extensible Job Managers for Grid Computing
Grid computing is becoming an important framework for enabling applications to utilize widely distributed collections of computational and data resources, however current grid sof...
Paul D. Coddington, Lici Lu, Darren Webb, Andrew L...
192
Voted
SAC
2009
ACM
15 years 11 months ago
Self-organized control of knowledge generation in pervasive computing systems
Pervasive computing devices (e.g., sensor networks, localization devices, cameras, etc.) are increasingly present in every aspect of our lives. These devices are able to generate ...
Gabriella Castelli, Ronaldo Menezes, Franco Zambon...
MM
2000
ACM
98views Multimedia» more  MM 2000»
15 years 11 months ago
Determining computable scenes in films and their structures using audio-visual memory models
In this paper we present novel algorithms for computing scenes and within-scene structures in films. We begin by mapping insights from film-making rules and experimental results f...
Hari Sundaram, Shih-Fu Chang
DAM
2007
177views more  DAM 2007»
15 years 6 months ago
On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
Given A := {a1, . . . , am} ⊂ Rd whose affine hull is Rd, we study the problems of computing an approximate rounding of the convex hull of A and an approximation to the minimum ...
Michael J. Todd, E. Alper Yildirim