5022 search results - page 4 / 1005 » Data structures and problem solving using Java |
SIAMCOMP
1998
13 years 7 months ago
1998
We describe a new randomized data structure, the sparse partition, for solving the dynamic closest-pair problem. Using this data structure the closest pair of a set of n points in ...
SIGCSE
2006
ACM
14 years 1 months ago
2006
ACM
This paper describes a significant redesign of the introductory courses at the University of Washington that has led to increased enrollments, increased student satisfaction and a...
ICALT
2003
IEEE
14 years 25 days ago
2003
IEEE
Analysis of collaborative problem solving involves analysis of dialogue and interaction, analysis of tasks and social roles through ethnographic and other field studies. Use of to...
ISSTA
1998
ACM
13 years 11 months ago
1998
ACM
Automatic test data generation leads to identify input values on which a selected point in a procedure is executed. This paper introduces a new method for this problem based on co...
ISSAC
2005
Springer
14 years 1 months ago
2005
Springer
This paper presents a duality analysis and an algorithm for computing the multiplicity structure of a zero to a polynomial system, while the zero can be exact or approximate with ...