Yll Haxhimusa - Citegraph

Author Info

Name	Affiliation	Papers
YLL HAXHIMUSA	Pattern Recognition and Image Processing Group 183/2, Institute for Computer Aided Automation, Vienna University of Technology, Austria	34
Collaborators	Citations	PageRank
34	233	20.26
Referers	Referees	References
362	543	394

Search Limit

100543

Publications (34 rows)

Collaborators (34 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
A framework for the extraction of quantitative traits from 2D images of mature Arabidopsis thaliana	2	0.37	2016
Resource-bounded Problem Solving (Dagstuhl Seminar 14341).	0	0.34	2014
Image-Based Phenotyping Of The Mature Arabidopsis Shoot System	4	0.43	2014
Estimation of Distribution Algorithm for the Max-Cut Problem.	2	0.37	2013
Graph-Based Representations in Pattern Recognition: 9th IAPR-TC-15 International Workshop, GbRPR 2013, Vienna, Austria, May 15-17, 2013, Proceedings	26	1.33	2013
Interactive Labeling of Image Segmentation Hierarchies.	2	0.38	2012
Architectural Style Classification of Domes.	3	0.47	2012
Segmentation of Building Facade Domes.	0	0.34	2012
Architectural style classification of building facade windows	9	0.65	2011
Hierarchical interactive image segmentation using irregular pyramids	1	0.36	2011
Computer Science & Problem Solving: New Foundations (Dagstuhl Seminar 11351).	2	0.42	2011
2d And 3d Traveling Salesman Problem	4	0.57	2011
Directly computing the generators of image homology using graph pyramids	13	0.99	2009
An improved coordinate system for point correspondences of 2D articulated shapes	0	0.34	2009
Approximative graph pyramid solution of the E-TSP	5	0.62	2009
A coordinate system for articulated 2D shape point correspondences	1	0.36	2008
Decomposition for efficient eccentricity transform of convex shapes	2	0.41	2007
Computing homology group generators of images using irregular graph pyramids	12	0.92	2007
Approximating TSP solution by MST based graph pyramid	4	0.47	2007
Traveling Salesman Problem: A Foveating Pyramid Model	20	1.84	2006
Considerations regarding the minimum spanning tree pyramid segmentation method	6	0.52	2006
Distinguishing 3D-Topological Configurations of Two Tori	0	0.34	2006
Irregular pyramid segmentations with stochastic graph decimation strategies	1	0.35	2006
The eccentricity transform (of a digital shape)	9	0.65	2006
Evaluating Hierarchical Graph-based Segmentation	4	0.42	2006
Evaluating minimum spanning tree based segmentation algorithms	6	0.50	2005
Vision pyramids that do not grow too high	29	1.16	2005
A graph-based concept for spatiotemporal information in cognitive vision	2	0.37	2005
Grouping of non-connected structures by an irregular graph pyramid	0	0.34	2005
Segmentation Graph Hierarchies	29	1.05	2004
Integral trees: subtree depth and diameter	2	0.40	2004
Constructing stochastic pyramids by MIDES: maximal independent directed edge set	11	0.66	2003
Hierarchy of Partitions with Dual Graph Contraction	11	0.74	2003
Logarithmic Tapering Graph Pyramid	11	0.80	2002