5363 search results - page 465 / 1073 » Building the Cerebellum in a Computer |
210
Voted
VISUALIZATION
2002
IEEE
16 years 9 days ago
2002
IEEE
Within the field of computer graphics and visualization, it is often necessary to visualize polygonal models with large number of polygons. Display quality is mandatory, but it i...
195
click to vote
CHI
2000
ACM
15 years 11 months ago
2000
ACM
We can reliably build “second generation” intelligent computer tutors that are approximately half as effective as human tutors. This paper evaluates two interface enhancements...
217
Voted
ACSC
2001
IEEE
15 years 11 months ago
2001
IEEE
The integration of alias analysis with type information increases the precision of alias detection, especially for inheritance among classes. This paper presents a compile-time fl...
219
Voted
WG
1995
Springer
15 years 11 months ago
1995
Springer
We propose an O(n4) algorithm to build the modular decomposition tree of hypergraphs of dimension 3 and show how this algorithm can be generalized to compute in O(n3k−5) time th...
238
Voted
AAAI
2004
15 years 8 months ago
2004
A memory-based heuristic is a heuristic function that is stored in a lookup table. Very accurate heuristics have been created by building very large lookup tables, sometimes calle...