Sciweavers

618 search results - page 26 / 124
» Meaning and Partiality Revised
Sort
View
JGAA
2006
108views more  JGAA 2006»
13 years 10 months ago
Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
Let G = (V, E) be a graph with n vertices and let P be a set of n points in the plane. We show that deciding whether there is a planar straight-line embedding of G such that the v...
Sergio Cabello
AML
2005
65views more  AML 2005»
13 years 10 months ago
Middle diamond
Under certain cardinal arithmetic assumptions, we prove that for every large enough regular cardinal, for many regular < , many stationary subsets of concentrating on cofinali...
Saharon Shelah
WIKIS
2009
ACM
14 years 4 months ago
Organizing the vision for web 2.0: a study of the evolution of the concept in Wikipedia
Information Systems (IS) innovations are often characterized by buzzwords, reflecting organizing visions that structure and express the images and ideas formed by a wide community...
Arnaud Gorgeon, E. Burton Swanson
CSFW
2006
IEEE
14 years 4 months ago
Resolve-Impossibility for a Contract-Signing Protocol
Abstract. A multi-party contract signing protocol allows a set of participants to exchange messages with each other with a view to arriving in a state in which each of them has a p...
Aybek Mukhamedov, Mark Dermot Ryan
ECOOP
1998
Springer
14 years 2 months ago
A Study of The Fragile Base Class Problem
In this paper we study the fragile base class problem. This problem occurs in open object-oriented systems employing code inheritance as an implementation reuse mechanism. System d...
Leonid Mikhajlov, Emil Sekerinski