Sciweavers

207 search results - page 7 / 42
» ideas 1998
Sort
View
INFORMATICALT
1998
126views more  INFORMATICALT 1998»
13 years 7 months ago
On Local Bandwidth Selection for Density Estimation
This article gives ideas for developing statistics software which can work without user intervention. Some popular methods of bandwidth selection for kernel density estimation (the...
Rimantas Rudzkis, Mindaugas Kavaliauskas
IPL
1998
177views more  IPL 1998»
13 years 7 months ago
A Common-Multiplicand Method to the Montgomery Algorithm for Speeding up Exponentiation
A common-multiplicand method to the Montgomery algorithm makes an improvement in speed when the right-to-left binary exponentiation is applied. The idea is that the same common pa...
JaeCheol Ha, Sang-Jae Moon
KBS
1998
122views more  KBS 1998»
13 years 7 months ago
Concept formation in design
: This paper presents a computationally tractable view on where simple design concepts come from by proposing a paradigm for the formation of design concepts based on the emergence...
John S. Gero
ORL
1998
130views more  ORL 1998»
13 years 7 months ago
Accelerating convergence in the Fermat-Weber location problem
This paper presents a simple procedure for accelerating convergence in a generalized Fermat–Weber problem with lp distances. The main idea is to multiply the predetermined step ...
Jack Brimberg, Reuven Chen, Doron Chen
SIGACT
1998
105views more  SIGACT 1998»
13 years 7 months ago
Everything you wanted to know about the running time of Mergesort but were afraid to ask
Although mergesort is an algorithm that is frequently glossed over in textbooks, it provides fertile ground for planting ideas about algorithm analysis in the minds of students. A...
Ian Parberry