Sciweavers

4949 search results - page 5 / 990
» Consistency and Set Intersection
Sort
View
COMPGEOM
2001
ACM
14 years 2 months ago
Segment intersection searching problems in general settings
We consider segment intersection searching amidst (possibly intersecting) algebraic arcs in the plane. We show how to preprocess n arcs in time O(n2+ ) into a data structure of si...
Vladlen Koltun
COMBINATORICS
2002
70views more  COMBINATORICS 2002»
13 years 10 months ago
Set-Systems with Restricted Multiple Intersections
We give a generalization for the Deza-Frankl-Singhi Theorem in case of multiple intersections. More exactly, we prove, that if H is a set-system, which satisfies that for some k, ...
Vince Grolmusz
SIAMDM
2010
87views more  SIAMDM 2010»
13 years 5 months ago
Set Systems without a Strong Simplex
A d-simplex is a collection of d + 1 sets such that every d of them have non-empty intersection and the intersection of all of them is empty. A strong d-simplex is a collection of...
Tao Jiang, Oleg Pikhurko, Zelealem Yilma
ATAL
2007
Springer
14 years 4 months ago
Routing games with an unknown set of active players
In many settings there exists a set of potential participants, but the set of participants who are actually active in the system, and in particular their number, is unknown. This ...
Itai Ashlagi, Dov Monderer, Moshe Tennenholtz
ICTCS
2005
Springer
14 years 3 months ago
Quantum Algorithms for a Set of Group Theoretic Problems
This work introduces two decision problems, StabilizerD and Orbit CosetD, and gives quantum reductions from them to the problem Orbit Superposition (Friedl et al., 2003), as well a...
Stephen A. Fenner, Yong Zhang