6299 search results - page 228 / 1260 » Data and Computation Abstractions for Dynamic and Irregular ... |
208
click to vote
CCGRID
2004
IEEE
15 years 11 months ago
2004
IEEE
Advances in Grid technology enable the deployment of data-intensive distributed applications, which require moving Terabytes or even Petabytes of data between data banks. The curr...
209
click to vote
ESOP
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. In logic programming, dynamic scheduling refers to a situation where the selection of the atom in each resolution (computation) step is determined at runtime, as opposed ...
192
click to vote
IPPS
2002
IEEE
16 years 3 days ago
2002
IEEE
Most current work in data mining assumes that the database is static, and a database update requires rediscovering all the patterns by scanning the entire old and new database. Su...
158
click to vote
ESEC
1991
Springer
15 years 10 months ago
1991
Springer
This paper presents a dynamic technique for predicting the e ect that a location" of a program will have on the program's computational behavior. The technique is based ...
262
click to vote
ADBIS
2007
Springer
15 years 11 months ago
2007
Springer
Classification based on k-nearest neighbors (kNN classification) is one of the most widely used classification methods. The number k of nearest neighbors used for achieving a high ...