Sciweavers

229 search results - page 4 / 46
» On the Number of Arrangements of Pseudolines
Sort
View
WEA
2009
Springer
104views Algorithms» more  WEA 2009»
14 years 2 months ago
Univariate Algebraic Kernel and Application to Arrangements
We present a cgal-based univariate algebraic kernel, which provides certied real-root isolation of univariate polynomials with integer coecients and standard functionalities such...
Sylvain Lazard, Luis Mariano Peñaranda, Eli...
ESA
2003
Springer
141views Algorithms» more  ESA 2003»
14 years 28 days ago
Jacobi Curves: Computing the Exact Topology of Arrangements of Non-singular Algebraic Curves
We present an approach that extends the BentleyOttmann sweep-line algorithm [3] to the exact computation of the topology of arrangements induced by non-singular algebraic curves o...
Nicola Wolpert
ICC
2008
IEEE
124views Communications» more  ICC 2008»
14 years 2 months ago
Sidewalk: A RFID Tag Anti-Collision Algorithm Exploiting Sequential Arrangements of Tags
Abstract—Although predicting the RFID tag distribution before a read cycle begins would be generally difficult and even futile, a likely and interesting scenario is where the ta...
Hyunho Koh, Sangki Yun, Hyogon Kim
COMBINATORICS
2007
64views more  COMBINATORICS 2007»
13 years 7 months ago
Arranging Numbers on Circles to Reach Maximum Total Variations
The dartboard problem is to arrange n numbers on a circle to obtain maximum risk, which is the sum of the q-th power of the absolute differences of adjacent
Ying-Jie Liao, Min-Zheng Shieh, Shi-Chun Tsai
JCT
2007
111views more  JCT 2007»
13 years 7 months ago
Lattice point counts for the Shi arrangement and other affinographic hyperplane arrangements
Hyperplanes of the form xj = xi + c are called affinographic. For an affinographic hyperplane arrangement in Rn, such as the Shi arrangement, we study the function f(m) that counts...
David Forge, Thomas Zaslavsky