Sciweavers

168 search results - page 26 / 34
» Chain Intersecting Families
Sort
View
IJBC
2008
112views more  IJBC 2008»
13 years 7 months ago
Computation and Visualization of bifurcation Surfaces
The localization of critical parameter sets called bifurcations is often a central task of the analysis of a nonlinear dynamical system. Bifurcations of codimension 1 that can be ...
Dirk Stiefs, Thilo Gross, Ralf Steuer, Ulrike Feud...
CG
2005
Springer
13 years 7 months ago
A new algorithm for Boolean operations on general polygons
A new algorithm for Boolean operations on general planar polygons is presented. It is available for general planar polygons (manifold or non-manifold, with or without holes). Edge...
Yu Peng, Jun-Hai Yong, Wei-Ming Dong, Hui Zhang, J...
FCT
2005
Springer
14 years 1 months ago
Almost Optimal Explicit Selectors
We understand selection by intersection as distinguishing a single element of a set by the uniqueness of its occurrence in some other set. More precisely, given two sets A and B, i...
Bogdan S. Chlebus, Dariusz R. Kowalski
PG
2003
IEEE
14 years 22 days ago
Adaptive Grouping and Subdivision for Simulating Hair Dynamics
We present a novel approach for adaptively grouping and subdividing hair using discrete level-of-detail (LOD) representations. The set of discrete LODs include hair strands, clust...
Kelly Ward, Ming C. Lin
STOC
2003
ACM
109views Algorithms» more  STOC 2003»
14 years 21 days ago
A new multilayered PCP and the hardness of hypergraph vertex cover
Given a k-uniform hypergraph, the Ek-Vertex-Cover problem is to find the smallest subset of vertices that intersects every hyperedge. We present a new multilayered PCP constructi...
Irit Dinur, Venkatesan Guruswami, Subhash Khot, Od...