Sciweavers

343 search results - page 48 / 69
» On Making Directed Graphs Transitive
Sort
View
CASES
2009
ACM
14 years 9 months ago
Spatial complexity of reversibly computable DAG
In this paper we address the issue of making a program reversible in terms of spatial complexity. Spatial complexity is the amount of memory/register locations required for perfor...
Mouad Bahi, Christine Eisenbeis
COCO
2010
Springer
186views Algorithms» more  COCO 2010»
15 years 3 months ago
Derandomized Parallel Repetition of Structured PCPs
A PCP is a proof system for NP in which the proof can be checked by a probabilistic verifier. The verifier is only allowed to read a very small portion of the proof, and in return ...
Irit Dinur, Or Meir
CSUR
1999
159views more  CSUR 1999»
14 years 11 months ago
Hubs, authorities, and communities
The Web can be naturally modeled as a directed graph, consisting of a set of abstract nodes (the pages) joined by directional edges (the hyperlinks). Hyperlinks encode a considerab...
Jon M. Kleinberg
PODS
1999
ACM
160views Database» more  PODS 1999»
15 years 4 months ago
Queries with Incomplete Answers over Semistructured Data
Semistructured data occur in situations where information lacks a homogeneous structure and is incomplete. Yet, up to now the incompleteness of information has not been re ected b...
Yaron Kanza, Werner Nutt, Yehoshua Sagiv
BMCBI
2008
83views more  BMCBI 2008»
14 years 12 months ago
Models of deletion for visualizing bacterial variation: an application to tuberculosis spoligotypes
Background: Molecular typing methods are commonly used to study genetic relationships among bacterial isolates. Many of these methods have become standardized and produce portable...
Josephine F. Reyes, Andrew R. Francis, Mark M. Tan...