Sciweavers

14 search results - page 2 / 3
» Adaptation of Eikonal Equation over Weighted Graph
Sort
View
CPC
2007
97views more  CPC 2007»
13 years 4 months ago
On an Online Spanning Tree Problem in Randomly Weighted Graphs
Abstract. This paper is devoted to an online variant of the minimum spanning tree problem in randomly weighted graphs. We assume that the input graph is complete and the edge weigh...
Jan Remy, Alexander Souza, Angelika Steger
IJCAI
2003
13 years 6 months ago
Continuous nonlinear dimensionality reduction by kernel Eigenmaps
We equate nonlinear dimensionality reduction (NLDR) to graph embedding with side information about the vertices, and derive a solution to either problem in the form of a kernel-ba...
Matthew Brand
DM
2008
112views more  DM 2008»
13 years 4 months ago
Orbit-counting polynomials for graphs and codes
We construct an "orbital Tutte polynomial" associated with a dual pair M and M of matrices over a principal ideal domain R and a group G of automorphisms of the row spac...
Peter J. Cameron, Bill Jackson, Jason D. Rudd
ICDAR
2009
IEEE
13 years 2 months ago
A Unified Framework for Recognizing Handwritten Chemical Expressions
Chemical expressions have more variant structures in 2-D space than that in math equations. In this paper we propose a unified framework for recognizing handwritten chemical expre...
Ming Chang, Shi Han, Dongmei Zhang
ECCV
2010
Springer
13 years 10 months ago
Adaptive Regularization for Image Segmentation Using Local Image Curvature Cues
Abstract. Image segmentation techniques typically require proper weighting of competing data fidelity and regularization terms. Conventionally, the associated parameters are set t...