Sciweavers

8370 search results - page 596 / 1674
» Challenges in P2P Computing
Sort
View
ICDE
2007
IEEE
128views Database» more  ICDE 2007»
16 years 8 months ago
Efficient Evaluation of All-Nearest-Neighbor Queries
The All Nearest Neighbor (ANN) operation is a commonly used primitive for analyzing large multi-dimensional datasets. Since computing ANN is very expensive, in previous works R*-t...
Yun Chen, Jignesh M. Patel
ICFP
2006
ACM
16 years 7 months ago
Programming monads operationally with Unimo
Monads are widely used in Haskell for modeling computational effects, but defining monads remains a daunting challenge. Since every part of a monad's definition depends on it...
Chuan-Kai Lin
EDBT
2009
ACM
118views Database» more  EDBT 2009»
16 years 2 months ago
Optimized union of non-disjoint distributed data sets
In a variety of applications, ranging from data integration to distributed query evaluation, there is a need to obtain sets of data items from several sources (peers) and compute ...
Itay Dar, Tova Milo, Elad Verbin
IPPS
2008
IEEE
16 years 1 months ago
Programmability of the HPCS Languages: A case study with a quantum chemistry kernel
As high-end computer systems present users with rapidly increasing numbers of processors, possibly also incorporating attached co-processors, programmers are increasingly challeng...
Aniruddha G. Shet, Wael R. Elwasif, Robert J. Harr...
ACSC
2007
IEEE
16 years 1 months ago
Mutually Visible Agents in a Discrete Environment
As computer controlled entities are set to move and explore more complex environments they need to be able to perform navigation tasks, like finding minimal cost routes. Much wor...
Joel Fenwick, Vladimir Estivill-Castro