516 search results - page 58 / 104 » Generalizing the Discrete Timed Automaton |
COCOA
2008
Springer
13 years 11 months ago
2008
Springer
We study the parameterized complexity of the following problem: is it possible to make a given graph r-regular by applying at most k elementary editing operations; the operations a...
ICML
2009
IEEE
14 years 10 months ago
2009
IEEE
We propose an unbounded-depth, hierarchical, Bayesian nonparametric model for discrete sequence data. This model can be estimated from a single training sequence, yet shares stati...
ICC
2009
IEEE
14 years 4 months ago
2009
IEEE
— Vehicle-to-vehicle (VTV) communications are of interest for applications within traffic safety and congestion avoidance, but the development of suitable communications systems...
COMPGEOM
2009
ACM
14 years 4 months ago
2009
ACM
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
COMPGEOM
2009
ACM
14 years 4 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 ...