Sciweavers

2435 search results - page 385 / 487
» Question Answering in Webclopedia
Sort
View
STOC
2010
ACM
170views Algorithms» more  STOC 2010»
15 years 10 months ago
Connectivity oracles for failure prone graphs
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
Ran Duan, Seth Pettie
CHI
1999
ACM
15 years 10 months ago
Cooperative Inquiry: Developing new Technologies for Children with Children
In today’s homes and schools, children are emerging as frequent and experienced users of technology [3, 14]. As this trend continues, it becomes increasingly important to ask if...
Allison Druin
RSP
1998
IEEE
126views Control Systems» more  RSP 1998»
15 years 10 months ago
Testing Prototypes Validity to Enhance Code Reuse
The complexity of distributed systems is a problem when designers want to evaluate their safety and liveness. Often, they are built by integration of existing components with newl...
Didier Buchs, A. Diagne, Fabrice Kordon
WETICE
1998
IEEE
15 years 10 months ago
Questionnaires: A Framework using Mobile Code for Component-Based Tele-Exams
Applications for computer supported cooperative work can gain from component models and frameworks. The framework for "questionnaires", which is described in this paper,...
Jakob Hummes, Arnd Kohrs, Bernard Mérialdo
ANTS
1998
Springer
139views Algorithms» more  ANTS 1998»
15 years 10 months ago
Generating Arithmetically Equivalent Number Fields with Elliptic Curves
In this note we address the question whether for a given prime number p, the zeta-function of a number field always determines the p-part of its class number. The answer is known t...
Bart de Smit