4047 search results - page 199 / 810 » The Discrete Basis Problem |
123
Voted
COMPGEOM
2006
ACM
15 years 7 months ago
2006
ACM
We prove that any collection of n discs in which each one intersects at most k others, can be colored with at most O(log3 k) colors so that for each point p in the union of all di...
101
Voted
COMPGEOM
1995
ACM
15 years 7 months ago
1995
ACM
A thrackle is a graph drawn in the plane so that its edges are represented by Jordan arcs and any two distinct arcs either meet at exactly one common vertex or cross at exactly on...
141
Voted
COMPGEOM
2005
ACM
15 years 5 months ago
2005
ACM
We present a near linear time algorithm for constructing hierarchical nets in finite metric spaces with constant doubling dimension. This data-structure is then applied to obtain...
130
Voted
WSC
2004
15 years 4 months ago
2004
Building computational models of real world systems usually requires the interaction of decision modules and simulation modules. Given different models and algorithms, the major h...
114
Voted
WSC
2000
15 years 4 months ago
2000
One of the approaches to modeling hybrid systems is to assign algebraic-differential equations describing the continuous behavior to states of state machines that represent discre...