Sciweavers

1018 search results - page 101 / 204
» Generative unbinding of names
Sort
View
ENTCS
2006
180views more  ENTCS 2006»
13 years 9 months ago
Mobile Synchronizing Petri Nets: A Choreographic Approach for Coordination in Ubiquitous Systems
The term Ubiquitous Computing was coined by Mark Weiser almost two decades ago. Despite all the time that has passed since Weiser's vision, ubiquitous computing still has a l...
Fernando Rosa Velardo, Olga Marroquín Alons...
JUCS
2008
140views more  JUCS 2008»
13 years 9 months ago
The Computable Multi-Functions on Multi-represented Sets are Closed under Programming
: In the representation approach to computable analysis (TTE) [Grz55, i00], abstract data like rational numbers, real numbers, compact sets or continuous real functions are represe...
Klaus Weihrauch
CACM
2000
225views more  CACM 2000»
13 years 9 months ago
Complementary Video and Audio Analysis for Broadcast News Archives
The Informedia Digital Video Library system extracts information from digitized video sources and allows full content search and retrieval over all extracted data. This extracted ...
Howard D. Wactlar, Alexander G. Hauptmann, Michael...
PLDI
2004
ACM
14 years 2 months ago
Vectorization for SIMD architectures with alignment constraints
When vectorizing for SIMD architectures that are commonly employed by today’s multimedia extensions, one of the new challenges that arise is the handling of memory alignment. Pr...
Alexandre E. Eichenberger, Peng Wu, Kevin O'Brien
FOCS
1999
IEEE
14 years 1 months ago
Near-Optimal Conversion of Hardness into Pseudo-Randomness
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson