516 search results - page 48 / 104 » Generalizing the Discrete Timed Automaton |
133
click to vote
CORR
2007
Springer
15 years 1 months ago
2007
Springer
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...
102
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
We consider the discrete, time-varying broadcast channel with memory, under the assumption that the channel states belong to a set of nite cardinality. We begin with the de nition...
144
click to vote
ICDT
2012
ACM
13 years 4 months ago
2012
ACM
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
118
click to vote
COMPGEOM
1994
ACM
15 years 5 months ago
1994
ACM
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...
129
Voted
PPDP
2010
Springer
14 years 11 months ago
2010
Springer
We propose a model for XML update primitives of the W3C XQuery Update Facility as parameterized rewriting rules of the form: "insert an unranked tree from a regular tree lang...