Sciweavers

2612 search results - page 154 / 523
» Assemblies as Graph Processes
Sort
View
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
ICDM
2010
IEEE
158views Data Mining» more  ICDM 2010»
15 years 4 months ago
Patterns on the Connected Components of Terabyte-Scale Graphs
How do connected components evolve? What are the regularities that govern the dynamic growth process and the static snapshot of the connected components? In this work, we study pat...
U. Kang, Mary McGlohon, Leman Akoglu, Christos Fal...
LION
2009
Springer
152views Optimization» more  LION 2009»
16 years 1 months ago
Comparison of Coarsening Schemes for Multilevel Graph Partitioning
Graph partitioning is a well-known optimization problem of great interest in theoretical and applied studies. Since the 1990s, many multilevel schemes have been introduced as a pra...
Cédric Chevalier, Ilya Safro