Sciweavers

197 search results - page 19 / 40
» On the Existence of Large Sets of t-designs of Prime Sizes
Sort
View
HIPC
2007
Springer
14 years 1 months ago
Experiments with a Parallel External Memory System
Abstract. The theory of bulk-synchronous parallel computing has produced a large number of attractive algorithms, which are provably optimal in some sense, but typically require th...
Mohammad R. Nikseresht, David A. Hutchinson, Anil ...
DMIN
2008
152views Data Mining» more  DMIN 2008»
13 years 8 months ago
PCS: An Efficient Clustering Method for High-Dimensional Data
Clustering algorithms play an important role in data analysis and information retrieval. How to obtain a clustering for a large set of highdimensional data suitable for database ap...
Wei Li 0011, Cindy Chen, Jie Wang
ICDE
2012
IEEE
223views Database» more  ICDE 2012»
11 years 9 months ago
Incremental Detection of Inconsistencies in Distributed Data
—This paper investigates the problem of incremental detection of errors in distributed data. Given a distributed database D, a set Σ of conditional functional dependencies (CFDs...
Wenfei Fan, Jianzhong Li, Nan Tang, Wenyuan Yu
CTRSA
2009
Springer
128views Cryptology» more  CTRSA 2009»
14 years 2 months ago
Short Redactable Signatures Using Random Trees
Abstract. A redactable signature scheme for a string of objects supports verification even if multiple substrings are removed from the original string. It is important that the re...
Ee-Chien Chang, Chee Liang Lim, Jia Xu
ICALP
2007
Springer
14 years 1 months ago
Deterministic History-Independent Strategies for Storing Information on Write-Once Memories
Motivated by the challenging task of designing “secure” vote storage mechanisms, we study information storage mechanisms that operate in extremely hostile environments. In suc...
Tal Moran, Moni Naor, Gil Segev