4488 search results - page 190 / 898 » Properties of NP-Complete Sets |
COLT
2010
Springer
13 years 6 months ago
2010
Springer
Clustering is a central unsupervised learning task with a wide variety of applications. Not surprisingly, there exist many clustering algorithms. However, unlike classification ta...
SIAMNUM
2011
13 years 3 months ago
2011
In this paper we prove the discrete compactness property for a wide class of p finite element approximations of non-elliptic variational eigenvalue problems in two and three spac...
ESORICS
2009
Springer
14 years 9 months ago
2009
Springer
We propose a probabilistic contract signing protocol that achieves balance even in the presence of an adversary that may delay messages sent over secure channels. To show that this...
AAECC
2007
Springer
14 years 2 months ago
2007
Springer
We consider a generalization of the codes defined by norm and trace functions on finite fields introduced by Olav Geil. The codes in the new family still satisfy Geil’s dualit...
ACSD
2005
IEEE
14 years 1 months ago
2005
IEEE
We provide an automata-theoretic solution to one of the main open questions about the UML standard, namely how to assign a formal semantics to a set of sequence diagrams without c...