Sciweavers

5022 search results - page 721 / 1005
» Data structures and problem solving using Java
Sort
View
SC
2004
ACM
15 years 8 months ago
The Potential of Computation Regrouping for Improving Locality
Improving program locality has become increasingly important on modern computer systems. An effective strategy is to group computations on the same data so that once the data are ...
Chen Ding, Maksim Orlovich
SIGMOD
2006
ACM
127views Database» more  SIGMOD 2006»
16 years 3 months ago
Efficient reverse k-nearest neighbor search in arbitrary metric spaces
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
Elke Achtert, Christian Böhm, Peer Kröge...
VISSYM
2004
15 years 4 months ago
Interactively Visualizing Procedurally Encoded Scalar Fields
Figure 1: RBF reconstruction of unstructured CFD data. (a) Volume rendering of 1,943,383 tetrahedral shock data set using 2,932 RBF functions. (b) Volume rendering of a 156,642 te...
Yun Jang, Manfred Weiler, Matthias Hopf, Jingshu H...
138
Voted
FAST
2007
15 years 4 months ago
Proportional-Share Scheduling for Distributed Storage Systems
Fully distributed storage systems have gained popularity in the past few years because of their ability to use cheap commodity hardware and their high scalability. While there are...
Yin Wang, Arif Merchant
PVLDB
2010
93views more  PVLDB 2010»
15 years 1 months ago
Distributed Threshold Querying of General Functions by a Difference of Monotonic Representation
The goal of a threshold query is to detect all objects whose score exceeds a given threshold. This type of query is used in many settings, such as data mining, event triggering, a...
Guy Sagy, Daniel Keren, Izchak Sharfman, Assaf Sch...