Sciweavers

4972 search results - page 398 / 995
» Ranking on graph data
Sort
View
171
Voted
PAMI
2010
133views more  PAMI 2010»
15 years 6 months ago
An Experimental Study of Graph Connectivity for Unsupervised Word Sense Disambiguation
— Word sense disambiguation (WSD), the task of identifying the intended meanings (senses) of words in context, has been a long-standing research objective for natural language pr...
Roberto Navigli, Mirella Lapata
203
Voted
ICIP
2005
IEEE
16 years 9 months ago
Object tracking based on morphological elastic graph matching
This paper presents a novel method for real-time tracking of objects in video sequences. Tracking is performed using the so-called Morphological Elastic Graph Matching algorithm. ...
Georgios N. Stamou, Nikos Nikolaidis, Ioannis Pita...
ESA
2004
Springer
137views Algorithms» more  ESA 2004»
16 years 1 months ago
Fast 3-Coloring Triangle-Free Planar Graphs
We show the first o(n2 ) algorithm for coloring vertices of trianglefree planar graphs using three colors. The time complexity of the algorithm is O(n log n). Our approach can be ...
Lukasz Kowalik
179
Voted
ICFEM
2000
Springer
15 years 11 months ago
Formal Treatment of a Family of Fixed-Point Problems on Graphs by CafeOBJ
A family of well known problems on graphs includingthe shortest path problem and the data flow analysis problem can be uniformly formulated as a fixed-point problem on graphs. We ...
Tetsuo Tamai
IJISTA
2008
87views more  IJISTA 2008»
15 years 7 months ago
On fusion of range and intensity information using Graph-Cut for planar patch segmentation
: Planar patch detection aims at simplifying data from 3-D imaging sensors to a more compact scene description. We propose a fusion of intensity and depth information using Graph-C...
Olaf Kähler, Erik Rodner, Joachim Denzler