Sciweavers

7197 search results - page 314 / 1440
» On the computational power of BlenX
Sort
View
CIKM
2006
Springer
15 years 10 months ago
Finding highly correlated pairs efficiently with powerful pruning
We consider the problem of finding highly correlated pairs in a large data set. That is, given a threshold not too small, we wish to report all the pairs of items (or binary attri...
Jian Zhang, Joan Feigenbaum
CONSTRAINTS
1999
105views more  CONSTRAINTS 1999»
15 years 6 months ago
Algorithmic Power from Declarative Use of Redundant Constraints
Interval constraints can be used to solve problems in numerical analysis. In this paper we show that one can improve the performance of such an interval constraint program by the ...
Maarten H. van Emden
DCG
1998
59views more  DCG 1998»
15 years 6 months ago
A Probabilistic Analysis of the Power of Arithmetic Filters
The assumption of real-number arithmetic, which is at the basis of conventional geometric algorithms, has been seriously challenged in recent years, since digital computers do not...
Olivier Devillers, Franco P. Preparata
ACSC
2002
IEEE
15 years 11 months ago
AdJava - Automatic Distribution of Java Applications
The majority of the world’s computing resources remains idle most of the time. By using this resource pool, an individual computation may be completed in a fraction of time requ...
Mohammad M. Fuad, Michael J. Oudshoorn
CLUSTER
2001
IEEE
15 years 10 months ago
Numerically-Intensive "Plug-and-Play" Parallel Computing
At UCLA's Plasma Physics Group, we have been successful in building and using a numerically-intensive parallel computing cluster using Power Macintosh hardware and the Macint...
Dean E. Dauger, Viktor K. Decyk