Sciweavers

2414 search results - page 100 / 483
» Computing Normal Subgroups
Sort
View
ECAI
2008
Springer
13 years 10 months ago
New Results for Horn Cores and Envelopes of Horn Disjunctions
We provide a characterization of Horn cores for formulas in conjunctive normal form (CNF) and, based on it, a novel algorithm for computing Horn cores of disjunctions of Horn CNFs ...
Thomas Eiter, Kazuhisa Makino
SEC
2003
13 years 10 months ago
Security, Fault-Tolerance and their Verification for Ambient Systems
For the emerging ambient environments, in which interconnected intelligent devices will surround us to increase the comfort of our lives, fault tolerance and security are of paramo...
Jaap-Henk Hoepman
FOCS
2010
IEEE
13 years 7 months ago
Learning Convex Concepts from Gaussian Distributions with PCA
We present a new algorithm for learning a convex set in n-dimensional space given labeled examples drawn from any Gaussian distribution. The complexity of the algorithm is bounded ...
Santosh Vempala
NAACL
2010
13 years 6 months ago
Efficient Parsing of Well-Nested Linear Context-Free Rewriting Systems
The use of well-nested linear context-free rewriting systems has been empirically motivated for modeling of the syntax of languages with discontinuous constituents or relatively f...
Carlos Gómez-Rodríguez, Marco Kuhlma...
ACCV
2007
Springer
14 years 1 months ago
Efficiently Solving the Fractional Trust Region Problem
Normalized Cuts has successfully been applied to a wide range of tasks in computer vision, it is indisputably one of the most popular segmentation algorithms in use today. A number...
Anders P. Eriksson, Carl Olsson, Fredrik Kahl