Sciweavers

3937 search results - page 189 / 788
» Questioning Ubiquitous Computing
Sort
View
EUROCRYPT
2004
Springer
15 years 9 months ago
On the Hardness of Information-Theoretic Multiparty Computation
We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational com...
Yuval Ishai, Eyal Kushilevitz
ICMCS
2000
IEEE
179views Multimedia» more  ICMCS 2000»
15 years 8 months ago
Mixing Realities in Shared Space: An Augmented Reality Interface for Collaborative Computing
In the Shared Space project, we explore, innovate, design and evaluate future computing environments that will radically enhance interaction between human and computers as well as...
Mark Billinghurst, Ivan Poupyrev, Hirokazu Kato, R...
IJCAI
2003
15 years 5 months ago
Recycling Computed Answers in Rewrite Systems for Abduction
In rule-based systems, goal-oriented computations correspond naturally to the possible ways that an observation may be explained. In some applications, we need to compute explanat...
Fangzhen Lin, Jia-Huai You
ACL
2009
15 years 1 months ago
ProLiV - a Tool for Teaching by Viewing Computational Linguistics
ProLiV - Animated Process-modeler of Complex (Computational) Linguistic Methods and Theories - is a fully modular, flexible, XML-based stand-alone Java application, used for compu...
Monica Gavrila, Cristina Vertan
JSC
2006
64views more  JSC 2006»
15 years 3 months ago
Computing the support of local cohomology modules
For a polynomial ring R = k[x1, ..., xn], we present a method to compute the characteristic cycle of the localization Rf for any nonzero polynomial f R that avoids a direct comput...
Josep Àlvarez Montaner, Anton Leykin