3134 search results - page 288 / 627 » Computing full disjunctions |
110
Voted
ACII
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Working with emotion-related states in technological contexts requires a standard representation format. Based on that premise, the W3C Emotion Incubator group was create...
136
Voted
COREGRID
2007
Springer
15 years 9 months ago
2007
Springer
This paper presents a case study in the generic design of Grid component models. It defines a framework allowing two component systems, one running in a CCA environment, and anoth...
117
click to vote
HPCC
2007
Springer
15 years 9 months ago
2007
Springer
In this paper we propose a new explicit congestion control approach, Open Box Protocol (OBP). The OBP gives sources the capacity to look inside the network and to make their conges...
134
click to vote
MFCS
2007
Springer
15 years 9 months ago
2007
Springer
We show that every NP problem is polynomially equivalent to a simple combinatorial problem: the membership problem for a special class of digraphs. These classes are defined by me...
122
Voted
SEMWEB
2007
Springer
15 years 9 months ago
2007
Springer
Abstract The most common matching applications, e.g., ontology matching, focus on the computation of the correspondences holding between the nodes of graph structures (e.g., concep...