Sciweavers

418 search results - page 49 / 84
» Circularity Measuring in Linear Time
Sort
View
TCBB
2010
104views more  TCBB 2010»
14 years 10 months ago
Fast Hinge Detection Algorithms for Flexible Protein Structures
— Analysis of conformational changes is one of the keys to the understanding of protein functions and interactions. For the analysis, we often compare two protein structures, tak...
Tetsuo Shibuya
SPAA
2004
ACM
15 years 5 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
PVLDB
2011
14 years 2 months ago
An Incremental Hausdorff Distance Calculation Algorithm
The Hausdorff distance is commonly used as a similarity measure between two point sets. Using this measure, a set X is considered similar to Y iff every point in X is close to at ...
Sarana Nutanong, Edwin H. Jacox, Hanan Samet
KBSE
2008
IEEE
15 years 6 months ago
Using n-grams to rapidly characterise the evolution of software code
Text-based approaches to the analysis of software evolution are attractive because of the fine-grained, token-level comparisons they can generate. The use of such approaches has, ...
Austen Rainer, Peter C. R. Lane, James A. Malcolm,...
85
Voted
PIMRC
2008
IEEE
15 years 6 months ago
A coherent amplify-and-forward relaying demonstrator without global phase reference
ACT In this work we present a demonstrator for coherent linear amplify-and-forward (AF) relaying. Two source/destination pairs communicate with the help of three half-duplex relays...
Stefan Berger, Armin Wittneben