Sciweavers

281 search results - page 7 / 57
» On Embedding a Graph on Two Sets of Points
Sort
View
3DOR
2008
14 years 12 months ago
Isometry-invariant Matching of Point Set Surfaces
Shape deformations preserving the intrinsic properties of a surface are called isometries. An isometry deforms a surface without tearing or stretching it, and preserves geodesic d...
Mauro R. Ruggeri, Dietmar Saupe
SIGCOMM
2010
ACM
14 years 9 months ago
The OKL4 microvisor: convergence point of microkernels and hypervisors
We argue that recent hypervisor-vs-microkernel discussions completely miss the point. Fundamentally, the two classes of systems h in common, and provide similar abstractions. We a...
Gernot Heiser, Ben Leslie
CVPR
2010
IEEE
15 years 3 months ago
One-Shot Multi-Set Non-rigid Feature-Spatial Matching
We introduce a novel framework for nonrigid feature matching among multiple sets in a way that takes into consideration both the feature descriptor and the features spatial arra...
Marwan Torki and Ahmed Elgammal
IWOCA
2010
Springer
223views Algorithms» more  IWOCA 2010»
14 years 4 months ago
Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes
The maximum independent set problem is NP-complete for graphs in general, but becomes solvable in polynomial time when restricted to graphs in many special classes. The problem is ...
Konrad Dabrowski, Vadim V. Lozin, Haiko Mülle...
RSA
2006
81views more  RSA 2006»
14 years 9 months ago
On random points in the unit disk
Let n be a positive integer and > 0 a real number. Let Vn be a set of n points in the unit disk selected uniformly and independently at random. Define G(, n) to be the graph w...
Robert B. Ellis, Xingde Jia, Catherine H. Yan