Sciweavers

167 search results - page 21 / 34
» Towards a Connector Algebra
Sort
View
SPAA
2006
ACM
14 years 4 months ago
Towards automatic parallelization of tree reductions in dynamic programming
Tree contraction algorithms, whose idea was first proposed by Miller and Reif, are important parallel algorithms to implement efficient parallel programs manipulating trees. Desp...
Kiminori Matsuzaki, Zhenjiang Hu, Masato Takeichi
AIED
2007
Springer
14 years 5 months ago
MathGirls: Toward Developing Girls' Positive Attitude and Self-Efficacy through Pedagogical Agents
MathGirls is a pedagogical-agent-based environment designed for high-school girls learning introductory algebra. Since females are in general more interested in interactive computi...
Yanghee Kim, Quan Wei, Beijie Xu, Youngah Ko, Vess...
PKDD
2007
Springer
102views Data Mining» more  PKDD 2007»
14 years 4 months ago
Towards Data Mining Without Information on Knowledge Structure
Most knowledge discovery processes are biased since some part of the knowledge structure must be given before extraction. We propose a framework that avoids this bias by supporting...
Alexandre Vautier, Marie-Odile Cordier, Rene Quini...
STOC
1998
ACM
135views Algorithms» more  STOC 1998»
14 years 3 months ago
Checking Polynomial Identities over any Field: Towards a Derandomization?
We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...
Daniel Lewin, Salil P. Vadhan
TAPSOFT
1997
Springer
14 years 2 months ago
The Railroad Crossing Problem: Towards Semantics of Timed Algorithms and Their Model Checking in High Level Languages
The goal of this paper is to analyse semantics of algorithms with explicit continuous time with further aim to nd approaches to automatize model checking in high level, easily unde...
Danièle Beauquier, Anatol Slissenko