Sciweavers

8825 search results - page 48 / 1765
» All for one or one for all
Sort
View
SIAMDM
2008
110views more  SIAMDM 2008»
13 years 7 months ago
The Minimum Number of Distinct Areas of Triangles Determined by a Set of n Points in the Plane
We prove a conjecture of Erdos, Purdy, and Straus on the number of distinct areas of triangles determined by a set of n points in the plane. We show that if P is a set of n points...
Rom Pinchasi
CORR
2006
Springer
98views Education» more  CORR 2006»
13 years 7 months ago
Faster Algorithms for Constructing a Concept (Galois) Lattice
In this paper, we present a fast algorithm for constructing a concept (Galois) lattice of a binary relation, including computing all concepts and their lattice order. We also prese...
Vicky Choi
CP
2009
Springer
14 years 8 months ago
Same-Relation Constraints
The ALLDIFFERENT constraint was one of the first global constraints [17] and it enforces the conjunction of one binary constraint, the not-equal constraint, for every pair of varia...
Christopher Jefferson, Karen E. Petrie, Meinolf Se...
FUIN
2000
85views more  FUIN 2000»
13 years 7 months ago
Stubborn Sets for Model Checking the EF/AG Fragment of CTL
The general stubborn set approach to CTL model checking 2] has the drawback that one either nds a stubborn set with only one enabled transition or one has to expand all enabled tra...
Karsten Schmidt 0004
ICPR
2002
IEEE
14 years 8 months ago
Projective Factorization of Planes and Cameras in Multiple Views
This paper proposes a novel method for the projective reconstruction of planes and cameras from multiple images by factorizing a matrix containing all planar homographies between ...
Carsten Rother, Stefan Carlsson, Dennis Tell