Sciweavers

1208 search results - page 16 / 242
» Uniform eventown problems
Sort
View
CPM
2004
Springer
120views Combinatorics» more  CPM 2004»
15 years 4 months ago
Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem
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...
Anders Dessmark, Jesper Jansson, Andrzej Lingas, E...
CCA
2000
Springer
15 years 3 months ago
The Uniformity Conjecture
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, ...
Daniel Richardson
WG
1998
Springer
15 years 3 months ago
Integral Uniform Flows in Symmetric Networks
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...
Farhad Shahrokhi, László A. Sz&eacut...
ACSAC
2005
IEEE
15 years 5 months ago
Uniform Application-level Access Control Enforcement of Organizationwide Policies
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 ...
Tine Verhanneman, Frank Piessens, Bart De Win, Wou...
CDC
2009
IEEE
132views Control Systems» more  CDC 2009»
15 years 4 months ago
Uniform stabilization of Markovian jump linear systems with logarithmic quantization - A convex approach
— In this paper, we investigate the almost sure uniform exponential stabilization problem of Markovian jump linear systems (MJLSs) with logarithmically quantized state feedbacks....
Chun Zhang, Geir E. Dullerud