136 search results - page 26 / 28 » Finite geometries |
COCOA
2008
Springer
13 years 9 months ago
2008
Springer
In a finite simple undirected graph, a vertex is simplicial if its neighborhood is a clique. We say that, for k 2, a graph G = (VG, EG) is the k-simplicial power of a graph H = (V...
COMPGEOM
2008
ACM
13 years 9 months ago
2008
ACM
The study of extremal problems on triangle areas was initiated in a series of papers by Erdos and Purdy in the early 1970s. In this paper we present new results on such problems, ...
COCOA
2010
Springer
13 years 5 months ago
2010
Springer
In a network environments supporting mobile entities (called robots or agents), a black hole is harmful site that destroys any incoming entity without leaving any visible trace. Th...
ECCV
2008
Springer
14 years 9 months ago
2008
Springer
Abstract. Finding solutions to minimal problems for estimating epipolar geometry and camera motion leads to solving systems of algebraic equations. Often, these systems are not tri...
ECCV
2006
Springer
14 years 9 months ago
2006
Springer
We present a method for retexturing non-rigid objects from a single viewpoint. Without reconstructing 3D geometry, we create realistic video with shape cues at two scales. At a coa...