1331 search results - page 173 / 267 » Complexity bounds for zero-test algorithms |
158
click to vote
ICDT
2012
ACM
13 years 5 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...
136
click to vote
DEDS
1998
15 years 2 months ago
1998
In this paper, timed Petri nets are used to model and control hybrid systems. Petri nets are used instead of finite automata primarily because of the advantages they offer in de...
119
click to vote
TIT
1998
15 years 2 months ago
1998
— The Godard or the constant modulus algorithm (CMA) is an effective technique for blind receiver design in communications. However, due to the complexity of the Constant Modulus...
120
click to vote
ICRA
2010
IEEE
15 years 1 months ago
2010
IEEE
— This paper is concerned with determining whether a mobile robot, called the pursuer, is up to maintaining visibility of an antagonist agent, called the evader. This problem, a ...
137
click to vote
IJDMB
2010
15 years 1 months ago
2010
: We explore whether protein-RNA interfaces differ from non-interfaces in terms of their structural features and whether structural features vary according to the type of the bound...