9842 search results - page 75 / 1969 » Problem complexity |
CIBCB
2008
IEEE
15 years 4 months ago
2008
IEEE
— Molecular docking is an essential tool for drug design. It helps the scientist to rapidly know if two molecules, respectively called ligand and receptor, can be combined togeth...
LATIN
1998
Springer
15 years 2 months ago
1998
Springer
The reconstruction of a shape or surface from a finite set of points is a practically significant and theoretically challenging problem. This paper presents a unified view of algor...
ICTCS
2005
Springer
15 years 3 months ago
2005
Springer
Given a vertex-weighted graph G = (V, E; w), w(v) ≥ 0 for any v ∈ V , we consider a weighted version of the coloring problem which consists in finding a partition S = (S1, . ...
CVPR
2010
IEEE
15 years 6 months ago
2010
IEEE
We present a region-based active contour detection algorithm for objects that exhibit relatively homogeneous photometric characteristics (e.g. smooth color or gray levels), embedd...
145
click to vote
CODCRY
2011
Springer
14 years 1 months ago
2011
Springer
We present the state of the art solvers of the Shortest and Closest Lattice Vector Problems in the Euclidean norm. We recall the three main families of algorithms for these problem...