1717 search results - page 77 / 344 » A Computable Spectral Theorem |
133
Voted
ICITA
2005
IEEE
15 years 9 months ago
2005
IEEE
Optimum theorems for combining QoS metrics to reduce computation time in nodes (routers) is proposed based on fundamental theorems on QoS metrics. The proposed theorems unify sele...
149
click to vote
ECCC
2010
15 years 2 months ago
2010
Bodlaender’s Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree width k and, if so, computes a width-k tree compositio...
134
click to vote
KDD
2004
ACM
16 years 4 months ago
2004
ACM
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...
144
click to vote
SMI
2006
IEEE
15 years 10 months ago
2006
IEEE
We present an algorithm for finding a meaningful vertexto-vertex correspondence between two 3D shapes given as triangle meshes. Our algorithm operates on embeddings of the two sh...
131
click to vote
CCCG
2009
15 years 5 months ago
2009
There are many depth measures on point sets that yield centerpoint theorems. These theorems guarantee the existence of points of a specified depth, a kind of geometric median. How...