2638 search results - page 16 / 528 » Random Geometric Complexes |
112
click to vote
COLT
2001
Springer
15 years 6 months ago
2001
Springer
Intrinsic complexity is used to measure the complexity of learning areas limited by broken-straight lines (called open semi-hulls) and intersections of such areas. Any strategy le...
AAECC
2004
Springer
15 years 1 months ago
2004
Springer
Abstract. Let C be an algebraic geometric code of dimension k and length n constructed on a curve X over Fq. Let s(C) be the state complexity of C and set w(C) := min{k, n-k}, the ...
117
click to vote
IFIP
2004
Springer
15 years 7 months ago
2004
Springer
Geometrical place can be sometimes difficult to find by applying mathematical methods. Evolutionary algorithms deal with a population of solutions. This population (initially ran...
112
click to vote
MOBIHOC
2007
ACM
16 years 1 months ago
2007
ACM
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We p...
112
click to vote
IWPEC
2009
Springer
15 years 8 months ago
2009
Springer
We study the parameterized complexity of the following fundamental geometric problems with respect to the dimension d: i) Given n points in Rd, compute their minimum enclosing cyl...