Sciweavers

256 search results - page 20 / 52
» Separation of NP-Completeness Notions
Sort
View
OSDI
2006
ACM
16 years 1 days ago
Making Information Flow Explicit in HiStar
HiStar is a new operating system designed to minimize the amount of code that must be trusted. HiStar provides strict information flow control, which allows users to specify preci...
David Mazières, Eddie Kohler, Nickolai Zeld...
STACS
2010
Springer
15 years 6 months ago
Finding Induced Subgraphs via Minimal Triangulations
Potential maximal cliques and minimal separators are combinatorial objects which were introduced and studied in the realm of minimal triangulation problems including Minimum Fill-i...
Fedor V. Fomin, Yngve Villanger
FSTTCS
2009
Springer
15 years 6 months ago
The Wadge Hierarchy of Max-Regular Languages
Recently, Mikołaj Boja´nczyk introduced a class of max-regular languages, an extension of regular languages of infinite words preserving many of its usual properties. This new c...
Jérémie Cabessa, Jacques Duparc, Ale...
60
Voted
CDC
2008
IEEE
15 years 6 months ago
Passivity-based output synchronization and flocking algorithm in SE(3)
Abstract— This paper addresses passivity-based output synchronization and a collision avoidance problem of rigid bodies in the Special Euclidean group SE(3) under the assumption ...
Yuji Igarashi, Takeshi Hatanaka, Masayuki Fujita, ...
COCOON
2007
Springer
15 years 6 months ago
"Resistant" Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas
We derive quadratic lower bounds on the ∗-complexity of sum-of-products-of-sums (ΣΠΣ) formulas for classes of polynomials f that have too few partial derivatives for the techn...
Maurice J. Jansen, Kenneth W. Regan