725 search results - page 142 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
ICALP
2003
Springer
14 years 18 days ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
ICTAI
2002
IEEE
14 years 10 days ago
2002
IEEE
(Appears as a regular paper in the proceedings of IEEE International Conference on Tools with Artificial Intelligence (ICTAI), IEEE Computer Society, Washington D.C. Nov. 2002, p...
ALT
2003
Springer
13 years 11 months ago
2003
Springer
Abstract. A crucial problem in machine learning is to choose an appropriate representation of data, in a way that emphasizes the relations we are interested in. In many cases this ...
BMCBI
2007
13 years 7 months ago
2007
Background: Domains are the basic functional units of proteins. It is believed that protein-protein interactions are realized through domain interactions. Revealing multi-domain c...
CRYPTO
2001
Springer
13 years 12 months ago
2001
Springer
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...