Sciweavers

281 search results - page 32 / 57
» On Embedding a Graph on Two Sets of Points
Sort
View
ICML
2005
IEEE
15 years 10 months ago
Implicit surface modelling as an eigenvalue problem
We discuss the problem of fitting an implicit shape model to a set of points sampled from a co-dimension one manifold of arbitrary topology. The method solves a non-convex optimis...
Christian Walder, Olivier Chapelle, Bernhard Sch&o...
JCT
2006
77views more  JCT 2006»
14 years 9 months ago
There are uncountably many topological types of locally finite trees
Consider two locally finite rooted trees as equivalent if each of them is a topological minor of the other, with an embedding preserving the tree-order. Answering a question of va...
Lilian Matthiesen
74
Voted
IJIG
2002
117views more  IJIG 2002»
14 years 9 months ago
Eigenspaces for Graphs
In this paper, we investigate the feasibility of using graph-based descriptions to learn the view structure of 3D objects. The graphs used in our study are constructed from the De...
Bin Luo, Edwin R. Hancock, Richard C. Wilson
APPROX
2008
Springer
100views Algorithms» more  APPROX 2008»
14 years 11 months ago
Optimal Random Matchings on Trees and Applications
In this paper we will consider tight upper- and lower-bounds on the weight of the optimal matching for random point sets distributed among the leaves of a tree, as a function of it...
Jeff Abrahamson, Béla Csaba, Ali Shokoufand...
90
Voted
IPPS
2006
IEEE
15 years 3 months ago
Battery aware dynamic scheduling for periodic task graphs
Battery lifetime, a primary design constraint for mobile embedded systems, has been shown to depend heavily on the load current profile. This paper explores how scheduling guidel...
V. Rao, N. Navet, G. Singhal, A. Kumar, G. S. Visw...