Sciweavers

2393 search results - page 171 / 479
» Bounds-Consistent Local Search
Sort
View
RECOMB
2004
Springer
16 years 3 months ago
Structured motifs search
In this paper we describe an algorithm for the localization of structured models, i.e. sequences of (simple) motifs and distance constraints. It basically combines standard patter...
Alberto Policriti, Nicola Vitacolonna, Michele Mor...
139
Voted
ICC
2007
IEEE
116views Communications» more  ICC 2007»
15 years 9 months ago
Skip Tree Graph: a Distributed and Balanced Search Tree for Peer-to-Peer Networks
Abstract—Skip Tree Graph is a novel, distributed, data structure for peer-to-peer systems that supports exact-match and order-based queries such as range queries efficiently. It...
Alejandra González Beltrán, Paul Sag...
SAT
2007
Springer
96views Hardware» more  SAT 2007»
15 years 9 months ago
From Idempotent Generalized Boolean Assignments to Multi-bit Search
Abstract. This paper shows that idempotents in finite rings of integers can act as Generalized Boolean Assignments (GBA’s) by providing a completeness theorem. We introduce the ...
Marijn Heule, Hans van Maaren
CPM
2004
Springer
86views Combinatorics» more  CPM 2004»
15 years 8 months ago
Optimizing Multiple Spaced Seeds for Homology Search
Optimized spaced seeds improve sensitivity and specificity in local homology search. Several authors have shown that multiple seeds can have better sensitivity and specificity t...
Jinbo Xu, Daniel G. Brown, Ming Li, Bin Ma
DAGM
2004
Springer
15 years 8 months ago
Scale-Invariant Object Categorization Using a Scale-Adaptive Mean-Shift Search
The goal of our work is object categorization in real-world scenes. That is, given a novel image we want to recognize and localize unseen-before objects based on their similarity t...
Bastian Leibe, Bernt Schiele