Sciweavers

493 search results - page 19 / 99
» Graph Database Indexing Using Structured Graph Decomposition
Sort
View
NLDB
2007
Springer
14 years 1 months 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...
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 5 months ago
Fast Approximation Algorithms for Cut-based Problems in Undirected Graphs
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given a...
Aleksander Madry
PODC
2010
ACM
13 years 9 months ago
Brief announcement: efficient graph algorithms without synchronization
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
Johannes Schneider, Roger Wattenhofer
JASIS
2007
125views more  JASIS 2007»
13 years 7 months ago
Approximate personal name-matching through finite-state graphs
cience Abstracts and Science Citation Index Expanded databases. The evaluation involved calculating the measures of precision and recall, based on completeness and accuracy. The re...
Carmen Galvez, Félix de Moya Anegón
IDEAS
2005
IEEE
111views Database» more  IDEAS 2005»
14 years 1 months ago
Evaluation of Queries on Tree-Structured Data Using Dimension Graphs
The recent proliferation of XML-based standards and technologies for managing data on the Web demonstrates the need for effective and efficient management of treestructured data....
Theodore Dalamagas, Dimitri Theodoratos, Antonis K...