727 search results - page 107 / 146 » One line and n points |
162
Voted
SODA
2007
ACM
15 years 7 months ago
2007
ACM
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...
186
click to vote
ICML
2008
IEEE
16 years 6 months ago
2008
IEEE
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...
143
click to vote
DCC
2007
IEEE
16 years 5 months ago
2007
IEEE
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...
151
Voted
CPM
2009
Springer
16 years 20 days ago
2009
Springer
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...
149
click to vote
COMPGEOM
2009
ACM
16 years 18 days ago
2009
ACM
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 ...