433 search results - page 7 / 87 » Generalized Ham-Sandwich Cuts |
3DPVT
2006
IEEE
14 years 1 months ago
2006
IEEE
Using Epipolar Image Analysis in the context of the correspondence finding problem in depth reconstruction has several advantages. One is the elegant incorporation of prior knowl...
DCG
2000
13 years 7 months ago
2000
We show how the flag f -vector of a polytope changes when cutting off any face, generalizing work of Lee for simple polytopes. The result is in terms of explicit linear operators o...
KDD
2004
ACM
14 years 7 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...
ISAAC
2005
Springer
14 years 26 days ago
2005
Springer
Let G = (V, E) be an undirected graph, and let B ⊆ V × V be a collection of vertex pairs. We give an incremental polynomial time algorithm to enumerate all minimal edge sets X ...
SIAMJO
2000
13 years 7 months ago
2000
There has been a great deal of success in the last twenty years with the use of cutting plane algorithms to solve specialized integer programming problems. Generally, these algori...