MCPR2
2011
12 years 7 months ago
2011
We present a strategy that combines color and depth images to detect people in indoor environments. Similarity of image appearance and closeness in 3D position over time yield weig...
IPMI
2011
Springer
12 years 8 months ago
2011
Springer
Abstract. Brain matching is an important problem in neuroimaging studies. Current surface-based methods for cortex matching and atlasing, although quite accurate, can require long ...
EJC
2011
12 years 8 months ago
2011
We provide a new proof of Brylawski’s formula for the Tutte polynomial of the tensor product of two matroids. Our proof involves extending Tutte’s formula, expressing the Tutte...
FOCS
2010
IEEE
13 years 2 months ago
2010
IEEE
We say an algorithm on n
CORR
2007
Springer
13 years 4 months ago
2007
Springer
We consider complete graphs with edge weights and/or node weights taking values in some set. In the first part of this paper, we show that a large number of graphs are completely...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We formulate weighted graph clustering as a prediction problem1 : given a subset of edge weights we analyze the ability of graph clustering to predict the remaining edge weights. ...
CGF
2008
13 years 4 months ago
2008
The evolution of dependencies in information hierarchies can be modeled by sequences of compound digraphs with edge weights. In this paper we present a novel approach to visualize...
IJCAI
2003
13 years 6 months ago
2003
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...
SWAT
2000
Springer
13 years 8 months ago
2000
Springer
Abstract. We show how to maintain centers and medians for a collection of dynamic trees where edges may be inserted and deleted and node and edge weights may be changed. All update...
DNA
2006
Springer
13 years 8 months ago
2006
Springer
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...