Sciweavers

5210 search results - page 784 / 1042
» Exact geometric computation
Sort
View
164
Voted
COMGEO
2008
ACM
15 years 3 months ago
Lower bounds for expected-case planar point location
Given a planar polygonal subdivision S, the point location problem is to preprocess S into a data structure so that the cell of the subdivision that contains a given query point c...
Theocharis Malamatos
132
Voted
COMGEO
2008
ACM
15 years 3 months ago
Constructing minimum-interference networks
A wireless ad-hoc network can be represented as a graph in which the nodes represent wireless devices, and the links represent pairs of nodes that communicate directly by means of...
Marc Benkert, Joachim Gudmundsson, Herman J. Haver...
104
Voted
CORR
2010
Springer
159views Education» more  CORR 2010»
15 years 3 months ago
An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks
We present an exact and complete algorithm to isolate the real solutions of a zero-dimensional bivariate polynomial system. The proposed algorithm constitutes an elimination metho...
Eric Berberich, Pavel Emeliyanenko, Michael Sagral...
CORR
2008
Springer
149views Education» more  CORR 2008»
15 years 3 months ago
Gaussian Belief Propagation for Solving Systems of Linear Equations: Theory and Application
The canonical problem of solving a system of linear equations arises in numerous contexts in information theory, communication theory, and related fields. In this contribution, we...
Ori Shental, Danny Bickson, Paul H. Siegel, Jack K...
115
Voted
DCC
2010
IEEE
15 years 3 months ago
On linear sets on a projective line
Linear sets generalise the concept of subgeometries in a projective space. They have many applications in finite geometry. In this paper we address two problems for linear sets: t...
Michel Lavrauw, Geertrui Van de Voorde