Sciweavers

8780 search results - page 282 / 1756
» On the Feasibility of Consistent Computations
Sort
View
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
GECCO
1999
Springer
15 years 11 months ago
Reaction Temperature Constraints in DNA Computing
Using the thermodynamics of DNA melting, a technique is proposed to choose a reaction temperature for the DNA computation that minimizes the potential for mishybridizations. Adlem...
Russell J. Deaton
WWW
2009
ACM
16 years 8 months ago
A geographical analysis of knowledge production in computer science
We analyze knowledge production in Computer Science by means of coauthorship networks. For this, we consider 30 graduate programs of different regions of the world, being 8 progra...
Alberto H. F. Laender, Guilherme Vale Menezes, Niv...
341
Voted
POPL
2008
ACM
16 years 7 months ago
Imperative self-adjusting computation
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...
Umut A. Acar, Amal Ahmed, Matthias Blume
213
Voted
EUROCRYPT
2003
Springer
16 years 20 days ago
Two-Threshold Broadcast and Detectable Multi-party Computation
Classical distributed protocols like broadcast or multi-party computation provide security as long as the number of malicious players f is bounded by some given threshold t, i.e., ...
Matthias Fitzi, Martin Hirt, Thomas Holenstein, J&...