Sciweavers

1190 search results - page 17 / 238
» On the Structure of Syntenic Distance
Sort
View
ECSQARU
2009
Springer
14 years 2 months ago
Non-deterministic Distance Semantics for Handling Incomplete and Inconsistent Data
Abstract. We introduce a modular framework for formalizing reasoning with incomplete and inconsistent information. This framework is composed of non-deterministic semantic structur...
Ofer Arieli, Anna Zamansky
ISAAC
2004
Springer
121views Algorithms» more  ISAAC 2004»
14 years 29 days ago
Approximate Distance Oracles for Graphs with Dense Clusters
Let G be a graph containing N disjoint t-spanners that are inter-connected with M edges. We present an algorithm that constructs a data structure of size O(M2 + n log n) that answ...
Mattias Andersson, Joachim Gudmundsson, Christos L...
BMCBI
2004
150views more  BMCBI 2004»
13 years 7 months ago
Inter-residue distances derived from fold contact propensities correlate with evolutionary substitution costs
Background: The wealth of information on protein structure has led to a variety of statistical analyses of the role played by individual amino acid types in the protein fold. In p...
Gareth Williams, Patrick Doherty
PR
2007
109views more  PR 2007»
13 years 7 months ago
Knowledge-based part correspondence
This paper presents a direct method for finding corresponding pairs of parts between two shapes. Statistical knowledge about a large number of parts from many different objects is...
Boaz J. Super
ICASSP
2011
IEEE
12 years 11 months ago
Polytope kernel density estimates on Delaunay graphs
We present a polytope-kernel density estimation (PKDE) methodology that allows us to perform exact mean-shift updates along the edges of the Delaunay graph of the data. We discuss...
Erhan Bas, Deniz Erdogmus