Sciweavers

99 search results - page 12 / 20
» Quantifier structure in search based procedures for QBFs
Sort
View
3DIM
2007
IEEE
15 years 6 months ago
Cached k-d tree search for ICP algorithms
The ICP (Iterative Closest Point) algorithm is the de facto standard for geometric alignment of threedimensional models when an initial relative pose estimate is available. The ba...
Andreas Nüchter, Kai Lingemann, Joachim Hertz...
CORR
2011
Springer
188views Education» more  CORR 2011»
14 years 6 months ago
Towards Unbiased BFS Sampling
Abstract—Breadth First Search (BFS) is a widely used approach for sampling large unknown Internet topologies. Its main advantage over random walks and other exploration technique...
Maciej Kurant, Athina Markopoulou, Patrick Thiran
BMCBI
2010
148views more  BMCBI 2010»
14 years 12 months ago
Analysis of interactions between ribosomal proteins and RNA structural motifs
Background: One important goal of structural bioinformatics is to recognize and predict the interactions between protein binding sites and RNA. Recently, a comprehensive analysis ...
Giovanni Ciriello, Claudio Gallina, Concettina Gue...
BMCBI
2008
200views more  BMCBI 2008»
14 years 12 months ago
Defining functional distances over Gene Ontology
Background: A fundamental problem when trying to define the functional relationships between proteins is the difficulty in quantifying functional similarities, even when well-stru...
Angela del Pozo, Florencio Pazos, Alfonso Valencia
CIKM
2008
Springer
15 years 1 months ago
Vanity fair: privacy in querylog bundles
A recently proposed approach to address privacy concerns in storing web search querylogs is bundling logs of multiple users together. In this work we investigate privacy leaks tha...
Rosie Jones, Ravi Kumar, Bo Pang, Andrew Tomkins