Sciweavers

14518 search results - page 2592 / 2904
» Two Problems for Sophistication
Sort
View
ESA
2008
Springer
102views Algorithms» more  ESA 2008»
15 years 8 months ago
Succinct Representations of Arbitrary Graphs
Abstract. We consider the problem of encoding a graph with n vertices and m edges compactly supporting adjacency, neighborhood and degree queries in constant time in the log n-bit ...
Arash Farzan, J. Ian Munro
ESORICS
2008
Springer
15 years 8 months ago
Remote Integrity Check with Dishonest Storage Server
We are interested in this problem: a verifier, with a small and reliable storage, wants to periodically check whether a remote server is keeping a large file x. A dishonest server,...
Ee-Chien Chang, Jia Xu
ADBIS
2010
Springer
154views Database» more  ADBIS 2010»
15 years 8 months ago
Platform Independent Database Replication Solution Applied to Medical Information System
Medical Information Systems (MIS) in general, like any other complex and large system, can be based on centralized or distributed DBMS. Centralized system is much easier for implem...
Tatjana Stankovic, Srebrenko Pesic, Dragan Jankovi...
APBC
2008
231views Bioinformatics» more  APBC 2008»
15 years 8 months ago
Optimal Algorithm for Finding DNA Motifs with Nucleotide Adjacent Dependency
: Finding motifs and the corresponding binding sites is a critical and challenging problem in studying the process of gene expression. String and matrix representations are two pop...
Francis Y. L. Chin, Henry C. M. Leung, Man-Hung Si...
ISEMANTICS
2010
15 years 8 months ago
Foundations of data interoperability on the web: a web science perspective
In this paper, when we use the term ontology, we are primarily referring to linked data in the form of RDF(S). The problem of ontology mapping has attracted considerable attention...
Hamid Haidarian Shahri
« Prev « First page 2592 / 2904 Last » Next »