Sciweavers

4926 search results - page 256 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
GECCO
2005
Springer
138views Optimization» more  GECCO 2005»
15 years 12 months ago
Hierarchical multi-sensor image registration using evolutionary computation
Image registration between multi-sensor imagery is a challenging problem due to the difficulties associated with finding a correspondence between pixels from images taken by the...
Ju Han, Bir Bhanu
SIGMOD
2011
ACM
250views Database» more  SIGMOD 2011»
14 years 9 months ago
Hybrid in-database inference for declarative information extraction
In the database community, work on information extraction (IE) has centered on two themes: how to effectively manage IE tasks, and how to manage the uncertainties that arise in th...
Daisy Zhe Wang, Michael J. Franklin, Minos N. Garo...
BIBE
2007
IEEE
114views Bioinformatics» more  BIBE 2007»
16 years 21 days ago
A Hierarchical Grow-and-Match Algorithm for Backbone Resonance Assignments Given 3D Structure
Abstract—This paper develops an algorithm for NMR backbone resonance assignment given a 3D structure and a set of relatively sparse 15 N-edited NMR data, with the through-space 1...
Fei Xiong, Chris Bailey-Kellogg
GD
2004
Springer
15 years 11 months ago
Graph Drawing by Stress Majorization
Abstract. One of the most popular graph drawing methods is based on achieving graph-theoretic target distances. This method was used by Kamada and Kawai [15], who formulated it as ...
Emden R. Gansner, Yehuda Koren, Stephen C. North
GMP
2000
IEEE
117views Solid Modeling» more  GMP 2000»
15 years 10 months ago
Distance Computation between Non-Convex Polyhedra at Short Range Based on Discrete Voronoi Regions
An algorithm for calculating the minimum distance between non-convex polyhedra is described. A polyhedron is represented by a set of triangles. In calculating the distance between...
Katsuaki Kawachi, Hiromasa Suzuki