Sciweavers

101 search results - page 15 / 21
» An Algorithm to Find a Perfect Map for Graphoid Structures
Sort
View
109
Voted
ICAI
2008
15 years 4 months ago
Nonrestrictive Concept-Acquisition by Representational Redescription
coarse procedures or very abstract frames from the point of view of algorithm, because some crucial issues like the representation, evolution, storage, and learning process of conc...
Hui Wei, Yan Chen
GIS
2006
ACM
16 years 3 months ago
Object localization based on directional information case of 2D vector data
If you were told that some object A was perfectly (or somewhat, or not at all) in some direction (e.g., west, above-right) of some reference object B, where in space would you loo...
Stelian Coros, JingBo Ni, Pascal Matsakis
135
Voted
IPPS
2010
IEEE
15 years 13 days ago
Large neighborhood local search optimization on graphics processing units
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
Thé Van Luong, Nouredine Melab, El-Ghazali ...
RECOMB
2004
Springer
16 years 2 months ago
A random graph approach to NMR sequential assignment
Nuclear magnetic resonance (NMR) spectroscopy allows scientists to study protein structure, dynamics and interactions in solution. A necessary first step for such applications is ...
Chris Bailey-Kellogg, Sheetal Chainraj, Gopal Pand...
130
Voted
CVPR
2004
IEEE
16 years 4 months ago
A Graphical Model Framework for Coupling MRFs and Deformable Models
This paper proposes a new framework for image segmentation based on the integration of MRFs and deformable models using graphical models. We first construct a graphical model to r...
Rui Huang, Vladimir Pavlovic, Dimitris N. Metaxas