Sciweavers

9997 search results - page 347 / 2000
» The case for crowd computing
Sort
View
TMM
2002
130views more  TMM 2002»
15 years 6 months ago
Computable scenes and structures in films
In this paper, we present a computational scene model and also derive novel algorithms for computing audio and visual scenes and within-scene structures in films. We use constraint...
Hari Sundaram, Shih-Fu Chang
TIT
2011
149views more  TIT 2011»
15 years 1 months ago
Network Coding for Computing: Cut-Set Bounds
Abstract—The following network computing problem is considered. Source nodes in a directed acyclic network generate independent messages and a single receiver node computes a tar...
Rathinakumar Appuswamy, Massimo Franceschetti, Nik...
ICC
2007
IEEE
127views Communications» more  ICC 2007»
16 years 1 months ago
Inter-Domain Path Computation using Improved Crankback Signaling in Label Switched Networks
—For label switched networks, such as MPLS and GMPLS, most existing traffic engineering (TE) solutions work in a single routing domain. These solutions do not work when a route ...
Faisal Aslam, Zartash Afzal Uzmi, Adrian Farrel, M...
FOCS
2006
IEEE
16 years 23 days ago
Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority
Secret sharing and multiparty computation (also called “secure function evaluation”) are fundamental primitives in modern cryptography, allowing a group of mutually distrustfu...
Michael Ben-Or, Claude Crépeau, Daniel Gott...
PPAM
2005
Springer
16 years 6 days ago
A Web Computing Environment for Parallel Algorithms in Java
We present a web computing library (PUBWCL) in Java that allows to execute tightly coupled, massively parallel algorithms in the bulk-synchronous (BSP) style on PCs distributed ove...
Olaf Bonorden, Joachim Gehweiler, Friedhelm Meyer ...