Sciweavers

322 search results - page 37 / 65
» Least Expected Cost Query Optimization: What Can We Expect
Sort
View
IJDSN
2008
81views more  IJDSN 2008»
13 years 8 months ago
A Flexible Stochastic Automaton-Based Algorithm for Network Self-Partitioning
This article proposes a flexible and distributed stochastic automaton-based network partitioning algorithm that is capable of finding the optimal k-way partition with respect to a...
Yan Wan, Sandip Roy, Ali Saberi, Bernard C. Lesieu...
PET
2010
Springer
14 years 18 days ago
How Unique Is Your Web Browser?
We investigate the degree to which modern web browsers are subject to “device fingerprinting” via the version and configuration information that they will transmit to website...
Peter Eckersley
ICPP
2005
IEEE
14 years 2 months ago
Filter Decomposition for Supporting Coarse-Grained Pipelined Parallelism
We consider the filter decomposition problem in supporting coarse-grained pipelined parallelism. This form of parallelism is suitable for data-driven applications in scenarios wh...
Wei Du, Gagan Agrawal
MASS
2010
160views Communications» more  MASS 2010»
13 years 6 months ago
Dynamic operator replacement in sensor networks
We present an integrated approach for supporting in-network sensor data processing in dynamic and heterogeneous sensor networks. The concept relies on data stream processing techni...
Moritz Striibe, Michael Daum, Rüdiger Kapitza...
PDIS
1994
IEEE
14 years 23 days ago
A Predicate-based Caching Scheme for Client-Server Database Architectures
We propose a new client-side data-caching scheme for relational databases with a central server and multiple clients. Data are loaded into each client cache based on queries execut...
Arthur M. Keller, Julie Basu