Sciweavers

2941 search results - page 121 / 589
» The Myth of the Educational Computer
Sort
View
CORR
2010
Springer
112views Education» more  CORR 2010»
13 years 10 months ago
Transdichotomous Results in Computational Geometry, II: Offline Search
We reexamine fundamental problems from computational geometry in the word RAM model, where input coordinates are integers that fit in a machine word. We develop a new algorithm fo...
Timothy M. Chan, Mihai Patrascu
CORR
2006
Springer
117views Education» more  CORR 2006»
13 years 10 months ago
A Computational Model of Spatial Memory Anticipation during Visual Search
Some visual search tasks require to memorize the location of stimuli that have been previously scanned. Considerations about the eye movements raise the question of how we are able...
Jérémy Fix, Julien Vitay, Nicolas P....
CORR
2006
Springer
101views Education» more  CORR 2006»
13 years 10 months ago
Fast computation of power series solutions of systems of differential equations
We propose algorithms for the computation of the first N terms of a vector (or a full basis) of power series solutions of a linear system of differential equations at an ordinary ...
Alin Bostan, Frédéric Chyzak, Fran&c...
CORR
2007
Springer
115views Education» more  CORR 2007»
13 years 10 months ago
FPRAS for computing a lower bound for weighted matching polynomial of graphs
We give a fully polynomial randomized approximation scheme to compute a lower bound for the matching polynomial of any weighted graph at a positive argument. For the matching poly...
Shmuel Friedland
CORR
2007
Springer
130views Education» more  CORR 2007»
13 years 10 months ago
On Computing the Distinguishing Numbers of Planar Graphs and Beyond: a Counting Approach
A vertex k-labeling of graph G is distinguishing if the only automorphism that preserves the labels of G is the identity map. The distinguishing number of G, D(G), is the smallest...
Vikraman Arvind, Christine T. Cheng, Nikhil R. Dev...