Sciweavers

CRYPTO
2010
Springer
157views Cryptology» more  CRYPTO 2010»
14 years 16 days ago
Oblivious RAM Revisited
We reinvestigate the oblivious RAM concept introduced by Goldreich and Ostrovsky, which enables a client, that can store locally only a constant amount of data, to store remotely ...
Benny Pinkas, Tzachy Reinman
ICMAS
2000
14 years 24 days ago
Assessing Usage Patterns to Improve Data Allocation via Auctions
The data allocation problem in incomplete information environments consisting of self-motivated servers responding to users' queries is considered. Periodically, the servers ...
Rina Azoulay-Schwartz, Sarit Kraus
ECIS
2000
14 years 24 days ago
Information Filtering and Automatic Keyword Identification by Artificial Neural Networks
Information filtering (IF) systems usually filter data items by correlating a vector of terms (keywords) that represent the user profile with similar vectors of terms that represe...
Zvi Boger, Tsvi Kuflik, Bracha Shapira, Peretz Sho...
ISTA
2004
14 years 25 days ago
Periodic Scheduling in On-Demand Broadcast System
: Recent advances in mobile computing have enabled the deployment of broadcast based information systems such as, wireless internet, traffic information systems, etc. These systems...
Nitin Prabhu, Vijay Kumar, Indrakshi Ray
APVIS
2001
14 years 25 days ago
Information Visualization of Attributed Relational Data
Traditional graph drawing is only concerned with viewing of data and relations amount data items. It uses a graph model to present the data items and the relations and tries to ca...
Mao Lin Huang
BNCOD
2004
65views Database» more  BNCOD 2004»
14 years 26 days ago
Reducing Damage Assessment Latency in Survivable Databases
Abstract. Traditional recovery mechanisms are not adequate in protecting databases from malicious attacks. A malicious transaction by virtue of writing on to the database can corru...
Indrakshi Ray, Ross M. McConnell, Monte Lunacek, V...
ACSW
2004
14 years 26 days ago
Cost-Efficient Mining Techniques for Data Streams
A data stream is a continuous and high-speed flow of data items. High speed refers to the phenomenon that the data rate is high relative to the computational power. The increasing...
Mohamed Medhat Gaber, Shonali Krishnaswamy, Arkady...
ITSL
2008
14 years 26 days ago
An Empirical Comparison of NML Clustering Algorithms
Clustering can be defined as a data assignment problem where the goal is to partition the data into nonhierarchical groups of items. In our previous work, we suggested an informati...
Petri Kontkanen, Petri Myllymäki
APVIS
2007
14 years 27 days ago
A comparison of vertex ordering algorithms for large graph visualization
In this study, we examine the use of graph ordering algorithms for visual analysis of data sets using visual similarity matrices. Visual similarity matrices display the relationsh...
Christopher Mueller, Benjamin Martin, Andrew Lumsd...
ACSW
2007
14 years 27 days ago
DGRID: A DHT-Based Resource Indexing and Discovery Scheme for Computational Grids
Traditional DHT (Distributed Hash Tables) abstraction distributes data items among peer nodes on a structured overlay network. This introduces a number of issues when nodes are un...
Verdi March, Yong Meng Teo, Xianbing Wang