Sciweavers

1675 search results - page 67 / 335
» Implementing Data Cubes Efficiently
Sort
View
MOBISYS
2006
ACM
14 years 9 months ago
Efficient and transparent dynamic content updates for mobile clients
We introduce a novel infrastructure supporting automatic updates for dynamic content browsing on resource constrained mobile devices. Currently, the client is forced to continuous...
Trevor Armstrong, Olivier Trescases, Cristiana Amz...
DBISP2P
2004
Springer
162views Database» more  DBISP2P 2004»
14 years 3 months ago
CISS: An Efficient Object Clustering Framework for DHT-Based Peer-to-Peer Applications
Distributed Hash Tables (DHTs) have been widely adopted in many Internet-scale P2P systems. Emerging P2P applications such as massively multi player online games (MMOGs) and P2P ca...
Jinwon Lee, Hyonik Lee, Seungwoo Kang, Sungwon Pet...
EWC
2002
90views more  EWC 2002»
13 years 9 months ago
An Efficient Adaptive Procedure for Three-Dimensional Fragmentation Simulations
We present a simple set of data structures, and a collection of methods for constructing and updating the structures, designed to support the use of cohesive elements in simulation...
Anna Pandolfi, Michael Ortiz
SIGMOD
2007
ACM
176views Database» more  SIGMOD 2007»
14 years 10 months ago
URank: formulation and efficient evaluation of top-k queries in uncertain databases
Top-k processing in uncertain databases is semantically and computationally different from traditional top-k processing. The interplay between query scores and data uncertainty ma...
Mohamed A. Soliman, Ihab F. Ilyas, Kevin Chen-Chua...
ICDE
2009
IEEE
159views Database» more  ICDE 2009»
14 years 4 months ago
Efficient Private Record Linkage
— Record linkage is the computation of the associations among records of multiple databases. It arises in contexts like the integration of such databases, online interactions and...
Mohamed Yakout, Mikhail J. Atallah, Ahmed K. Elmag...