Sciweavers

505 search results - page 83 / 101
» On A Graph Formalism for Ordered Edges
Sort
View
74
Voted
BMCBI
2007
146views more  BMCBI 2007»
14 years 9 months ago
Spatial location and its relevance for terminological inferences in bio-ontologies
Background: An adequate and expressive ontological representation of biological organisms and their parts requires formal reasoning mechanisms for their relations of physical aggr...
Stefan Schulz, Kornél G. Markó, Udo ...
ASIACRYPT
2010
Springer
14 years 7 months ago
Structured Encryption and Controlled Disclosure
We consider the problem of encrypting structured data (e.g., a web graph or a social network) in such a way that it can be efficiently and privately queried. For this purpose, we ...
Melissa Chase, Seny Kamara
CPM
1993
Springer
154views Combinatorics» more  CPM 1993»
15 years 1 months ago
On Suboptimal Alignments of Biological Sequences
It is widely accepted that the optimal alignment between a pair of proteins or nucleic acid sequences that minimizes the edit distance may not necessarily re ect the correct biolog...
Dalit Naor, Douglas L. Brutlag
CIKM
2009
Springer
15 years 4 months ago
Fast shortest path distance estimation in large networks
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
Michalis Potamias, Francesco Bonchi, Carlos Castil...
CP
2005
Springer
15 years 3 months ago
Speeding Up Constrained Path Solvers with a Reachability Propagator
Constrained path problems have to do with finding paths in graphs subject to constraints. One way of constraining the graph is by enforcing reachability on nodes. For instance, i...
Luis Quesada, Peter Van Roy, Yves Deville