Sciweavers

727 search results - page 107 / 146
» One line and n points
Sort
View
87
Voted
SODA
2007
ACM
127views Algorithms» more  SODA 2007»
14 years 11 months ago
Line-of-sight networks
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren ...
ICML
2008
IEEE
15 years 11 months ago
Sparse multiscale gaussian process regression
Most existing sparse Gaussian process (g.p.) models seek computational advantages by basing their computations on a set of m basis functions that are the covariance function of th...
Bernhard Schölkopf, Christian Walder, Kwang I...
DCC
2007
IEEE
15 years 9 months ago
Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits
Let p be a prime and let E(IFp) be an elliptic curve defined over the finite field IFp of p elements. For a given point G E(IFp) the linear congruential genarator on elliptic curv...
Jaime Gutierrez, Álvar Ibeas
CPM
2009
Springer
127views Combinatorics» more  CPM 2009»
15 years 4 months ago
Deconstructing Intractability: A Case Study for Interval Constrained Coloring
The NP-hard Interval Constrained Coloring problem appears in the interpretation of experimental data in biochemistry dealing with protein fragments. Given a set of m integer interv...
Christian Komusiewicz, Rolf Niedermeier, Johannes ...
75
Voted
COMPGEOM
2009
ACM
15 years 4 months ago
On grids in topological graphs
A topological graph is a graph drawn in the plane with vertices represented by points and edges as arcs connecting its vertices. A k-grid in a topological graph is a pair of edge ...
Eyal Ackerman, Jacob Fox, János Pach, Andre...