Sciweavers

168 search results - page 8 / 34
» Chain Intersecting Families
Sort
View
DGCI
2009
Springer
13 years 10 months ago
A Linear Time and Space Algorithm for Detecting Path Intersection
For discrete sets coded by the Freeman chain describing their contour, several linear algorithms have been designed for determining their shape properties. Most of them are based ...
Srecko Brlek, Michel Koskas, Xavier Provenç...
CCCG
1998
13 years 8 months ago
On point covers of c-oriented polygons
Let S be any family of n c-oriented polygons of the two-dimensional Euclidean plane E2 , i.e., bounded intersection of halfplanes whose normal directions of edges belong to a
Frank Nielsen
EJC
2008
13 years 7 months ago
On triangle-free distance-regular graphs with an eigenvalue multiplicity equal to the valency
Let be a triangle-free distance-regular graph with diameter d 3, valency k 3 and intersection number a2 = 0. Assume has an eigenvalue with multiplicity k. We show that if for ...
Kris Coolsaet, Aleksandar Jurisic, Jack H. Koolen
CORR
2008
Springer
92views Education» more  CORR 2008»
13 years 7 months ago
On sign conditions over real multivariate polynomials
We present a new probabilistic algorithm to find a finite set of points intersecting the closure of each connected component of the realization of every sign condition over a fami...
Gabriela Jeronimo, Daniel Perrucci, Juan Sabia
CHI
2010
ACM
13 years 10 months ago
A death in the family: opportunities for designing technologies for the bereaved
Following the death of a loved one, bereaved family members use technology in several ways to respond to their loss. However, very little is known about how technology intersects ...
Michael Massimi, Ronald M. Baecker