Sciweavers

516 search results - page 48 / 104
» Generalizing the Discrete Timed Automaton
Sort
View
CORR
2007
Springer
143views Education» more  CORR 2007»
13 years 10 months ago
An Approximation Algorithm for Shortest Descending Paths
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 ...
Mustaq Ahmed, Anna Lubiw
CORR
2008
Springer
103views Education» more  CORR 2008»
13 years 10 months ago
The Capacity Region of the Degraded Finite-State Broadcast Channel
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...
Ron Dabora, Andrea J. Goldsmith
ICDT
2012
ACM
251views Database» more  ICDT 2012»
12 years 10 days ago
Computing universal models under guarded TGDs
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...
André Hernich
COMPGEOM
1994
ACM
14 years 2 months ago
Computing Envelopes in Four Dimensions with Applications
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...
Pankaj K. Agarwal, Boris Aronov, Micha Sharir
PPDP
2010
Springer
13 years 7 months ago
Rewrite-based verification of XML updates
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...
Florent Jacquemard, Michaël Rusinowitch