Sciweavers

1519 search results - page 19 / 304
» Network Partitioning of Data Parallel Computations
Sort
View
WCE
2007
13 years 10 months ago
Data Communication and Parallel Computing on Twisted Hypercubes
Massively parallel distributed-memory architectures are receiving increasing attention to meet the increasing demand on processing power. Many topologies have been proposed for int...
Emad Abuelrub
DSN
2007
IEEE
14 years 3 months ago
Measuring Availability in Optimistic Partition-Tolerant Systems with Data Constraints
Replicated systems that run over partitionable environments, can exhibit increased availability if isolated partitions are allowed to optimistically continue their execution indep...
Mikael Asplund, Simin Nadjm-Tehrani, Stefan Beyer,...
VLDB
2008
ACM
147views Database» more  VLDB 2008»
14 years 9 months ago
Tree-based partition querying: a methodology for computing medoids in large spatial datasets
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...
ICDCS
2007
IEEE
14 years 3 months ago
A Virtual Node-Based Tracking Algorithm for Mobile Networks
— We introduce a virtual-node based mobile object tracking algorithm for mobile sensor networks, VINESTALK. The algorithm uses the Virtual Stationary Automata programming layer, ...
Tina Nolte, Nancy A. Lynch
ICDE
2010
IEEE
311views Database» more  ICDE 2010»
14 years 6 months ago
Detecting Inconsistencies in Distributed Data
— One of the central problems for data quality is inconsistency detection. Given a database D and a set Σ of dependencies as data quality rules, we want to identify tuples in D ...
Wenfei Fan, Floris Geerts, Shuai Ma, Heiko Mü...