Sciweavers

202 search results - page 19 / 41
» Dynamic and Redundant Data Placement
Sort
View
VISUALIZATION
2000
IEEE
13 years 12 months ago
A level-set method for flow visualization
In this paper we propose a technique for visualizing steady flow. Using this technique, we first convert the vector field data into a scalar level-set representation. We then a...
Rüdiger Westermann, Christopher Johnson, Thom...
BTW
2007
Springer
136views Database» more  BTW 2007»
14 years 1 months ago
System P: Completeness-driven Query Answering in Peer Data Management Systems
Abstract: Peer data management systems (PDMS) are a highly dynamic, decentralized infrastructure for large-scale data integration. They consist of a dynamic set of autonomous peers...
Armin Roth, Felix Naumann
ISLPED
2009
ACM
161views Hardware» more  ISLPED 2009»
14 years 2 months ago
Way guard: a segmented counting bloom filter approach to reducing energy for set-associative caches
The design trend of caches in modern processors continues to increase their capacity with higher associativity to cope with large data footprint and take advantage of feature size...
Mrinmoy Ghosh, Emre Özer, Simon Ford, Stuart ...
ISCAS
2008
IEEE
147views Hardware» more  ISCAS 2008»
14 years 1 months ago
An asynchronous time-based image sensor
Abstract— In this paper we propose a fully asynchronous, timebased image sensor, which is characterized by high temporal resolution, low data rate (near complete temporal redunda...
Christoph Posch, Daniel Matolin, Rainer Wohlgenann...
ICDE
1996
IEEE
157views Database» more  ICDE 1996»
14 years 9 months ago
High Availability in Clustered Multimedia Servers
Clustered multimedia servers, consisting of interconnected nodes and disks, have been proposed for large scale servers, that are capable of supporting multiple concurrent streams ...
Renu Tewari, Daniel M. Dias, Rajat Mukherjee, Harr...