8810 search results - page 367 / 1762 » Openness |
174
click to vote
CCIA
2009
Springer
15 years 7 months ago
2009
Springer
We present a mathematical framework for communicating about trust in terms of interactions. We argue that sharing an ontology about trust is not enough and that interactions are th...
155
click to vote
ALGORITHMICA
2010
15 years 6 months ago
2010
Given a stable marriage problem instance represented by a bipartite graph having 2n vertices and m edges, we describe an algorithm that can verify the stability of k different mat...
109
click to vote
AML
2008
15 years 6 months ago
2008
The Major Sub-degree Problem of A. H. Lachlan (first posed in 1967) has become a long-standing open question concerning the structure of the computably enumerable (c.e.) degrees. ...
161
click to vote
CPC
2008
15 years 6 months ago
2008
Let ai, bi, i = 0, 1, 2, . . . be drawn uniformly and independently from the unit interval, and let t be a fixed real number. Let a site (i, j) N2 be open if ai + bj t, and clos...
170
click to vote
DM
2010
15 years 6 months ago
2010
Given a polygon P in the plane, a pop operation is the reflection of a vertex with respect to the line through its adjacent vertices. We define a family of alternating polygons, a...