Sciweavers

439 search results - page 28 / 88
» Neighborhood Structures for GPU-Based Local Search Algorithm...
Sort
View
BMCBI
2010
116views more  BMCBI 2010»
13 years 8 months ago
A hybrid approach to protein folding problem integrating constraint programming with local search
Background: The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy func...
Abu Zafer M. Dayem Ullah, Kathleen Steinhöfel
SIGMOD
2004
ACM
153views Database» more  SIGMOD 2004»
14 years 2 months ago
Spatially-decaying aggregation over a network: model and algorithms
Data items are often associated with a location in which they are present or collected, and their relevance or in uence decays with their distance. Aggregate values over such data...
Edith Cohen, Haim Kaplan
AAAI
2007
13 years 11 months ago
Parallel Structured Duplicate Detection
We describe a novel approach to parallelizing graph search using structured duplicate detection. Structured duplicate detection was originally developed as an approach to external...
Rong Zhou, Eric A. Hansen
CG
2011
Springer
13 years 8 days ago
IA*: An adjacency-based representation for non-manifold simplicial shapes in arbitrary dimensions
We propose a compact, dimension-independent data structure for manifold, non-manifold and non-regular simplicial complexes, that we call the Generalized Indexed Data structure wit...
David Canino, Leila De Floriani, Kenneth Weiss
IROS
2007
IEEE
254views Robotics» more  IROS 2007»
14 years 3 months ago
3D datasets segmentation based on local attribute variation
— We present a Graph-based method for low-level segmentation of unfiltered 3D data. The core of this approach is based on the construction of a local neighborhood structure and ...
Carla Silva Rocha Aguiar, Sébastien Druon, ...