4047 search results - page 279 / 810 » The Discrete Basis Problem |
127
click to vote
COMPGEOM
2009
ACM
15 years 11 months ago
2009
ACM
We describe a new implementation of the well-known incremental algorithm for constructing Delaunay triangulations in any dimension. Our implementation follows the exact computing ...
142
click to vote
COMPGEOM
2009
ACM
15 years 11 months ago
2009
ACM
Color red and blue the n vertices of a convex polytope P in R3 . Can we compute the convex hull of each color class in o(n log n)? What if we have χ > 2 colors? What if the co...
122
Voted
COLT
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. We consider the problem of learning an acyclic discrete circuit with n wires, fan-in bounded by k and alphabet size s using value injection queries. For the class of tran...
141
click to vote
GECCO
2007
Springer
15 years 11 months ago
2007
Springer
The modeling and analysis of large networks of autonomous agents is an important topic with applications in many different disciplines. One way of modeling the development of such...
124
click to vote
HYBRID
2007
Springer
15 years 10 months ago
2007
Springer
We consider the problem of verifying reachability properties of stochastic real-time systems modeled as generalized semi-Markov processes (GSMPs). The standard simulation-based tec...