Sciweavers

1722 search results - page 37 / 345
» On the sample mean of graphs
Sort
View
SIAMCOMP
2008
80views more  SIAMCOMP 2008»
14 years 10 months ago
The Symmetric Group Defies Strong Fourier Sampling
Part I of this paper showed that the hidden subgroup problem over the symmetric group--including the special case relevant to Graph Isomorphism--cannot be efficiently solved by st...
Cristopher Moore, Alexander Russell, Leonard J. Sc...
WEBI
2007
Springer
15 years 4 months ago
Layers and Hierarchies in Real Virtual Networks
The virtual world is comprised of data items related to each other in a variety of contexts. Often such relations can be represented as graphs that evolve over time. Examples incl...
Olga Goussevskaia, Michael Kuhn 0002, Roger Watten...
NIPS
2004
14 years 11 months ago
Efficient Out-of-Sample Extension of Dominant-Set Clusters
Dominant sets are a new graph-theoretic concept that has proven to be relevant in pairwise data clustering problems, such as image segmentation. They generalize the notion of a ma...
Massimiliano Pavan, Marcello Pelillo
ICASSP
2011
IEEE
14 years 1 months ago
Sampling on locally defined principal manifolds
We start with a locally defined principal curve definition for a given probability density function (pdf) and define a pairwise manifold score based on local derivatives of the...
Erhan Bas, Deniz Erdogmus
ICPR
2008
IEEE
15 years 4 months ago
Real-time 3D tracking using multiple sample points
In this paper, we propose a method for robust and realtime estimation of 3D motion. In our method, we use multiple sample points that are on an object before and after moving. Poi...
Akihito Seki, Hiroshi Hattori