1208 search results - page 16 / 242 » Uniform eventown problems |
153
click to vote
CPM
2004
Springer
15 years 10 months ago
2004
Springer
For a set of rooted, unordered, distinctly leaf-labeled trees, the NP-hard maximum agreement subtree problem (MAST) asks for a tree contained (up to isomorphism or homeomorphism) i...
145
click to vote
CCA
2000
Springer
15 years 9 months ago
2000
Springer
The Exact Geometric Computing approach requires a zero test for numbers which are built up using standard operations starting with the natural numbers. The uniformity conjecture, ...
127
click to vote
WG
1998
Springer
15 years 9 months ago
1998
Springer
We study the integral uniform (multicommodity) flow problem in a graph G and construct a fractional solution whose properties are invariant under the action of a group of automorp...
133
click to vote
ACSAC
2005
IEEE
15 years 11 months ago
2005
IEEE
Fine-grained and expressive access control policies on application resources need to be enforced in applicationlevel code. Uniformly enforcing a single policy (referred to as the ...
121
click to vote
CDC
2009
IEEE
15 years 10 months ago
2009
IEEE
— In this paper, we investigate the almost sure uniform exponential stabilization problem of Markovian jump linear systems (MJLSs) with logarithmically quantized state feedbacks....