Sciweavers

3220 search results - page 191 / 644
» Constrained Graph Processes
Sort
View
POPL
1999
ACM
15 years 10 months ago
Types for Mobile Ambients
An ambient is a named cluster of processes and subambients, which moves as a group. We describe type systems able to guarantee that certain ambients will remain immobile, and that ...
Luca Cardelli, Andrew D. Gordon
LREC
2010
197views Education» more  LREC 2010»
15 years 8 months ago
Automatic Annotation of Co-Occurrence Relations
We introduce a method for automatically labelling edges of word co-occurrence graphs with semantic relations. Therefore we only make use of training data already contained within ...
Dirk Goldhahn, Uwe Quasthoff
CVPR
2008
IEEE
16 years 8 months ago
Manifold learning using robust Graph Laplacian for interactive image search
Interactive image search or relevance feedback is the process which helps a user refining his query and finding difficult target categories. This consists in partially labeling a ...
Hichem Sahbi, Patrick Etyngier, Jean-Yves Audibert...
NLDB
2007
Springer
16 years 17 days ago
Incomplete and Fuzzy Conceptual Graphs to Automatically Index Medical Reports
Most of Information Retrieval (IR) systems are still based on bag of word paradigm. This is a strong limitation if one needs high precision answers. For example, in restricted doma...
Loïc Maisonnasse, Jean-Pierre Chevallet, Cath...
DAGM
2009
Springer
15 years 7 months ago
A Gradient Descent Approximation for Graph Cuts
Abstract. Graph cuts have become very popular in many areas of computer vision including segmentation, energy minimization, and 3D reconstruction. Their ability to find optimal res...
Alparslan Yildiz, Yusuf Sinan Akgul