Sciweavers

2735 search results - page 215 / 547
» Comparing notions of randomness
Sort
View
DKE
2010
134views more  DKE 2010»
13 years 10 months ago
Combining ontological profiles with context in information retrieval
An ontology is a formal conceptualization of a domain, specifying the concepts of the domain and the relations between them. It is however not a straight forward task to use this ...
Geir Solskinnsbakk, Jon Atle Gulla
ENDM
2008
93views more  ENDM 2008»
13 years 10 months ago
The Generalized Max-Controlled Set Problem
In this work we deal with sandwich graphs G = (V, E) and present the notion of vertices f-controlled by a subset M V . We introduce the generalized maxcontrolled set problem (gmc...
Ivairton M. Santos, Carlos A. J. Martinhon, Luiz S...
CORR
2006
Springer
73views Education» more  CORR 2006»
13 years 10 months ago
Stable partitions in coalitional games
We propose a notion of a stable partition in a coalitional game that is parametrized by the concept of a defection function. This function assigns to each partition of the grand c...
Krzysztof R. Apt, Tadeusz Radzik
ENTCS
2006
140views more  ENTCS 2006»
13 years 10 months ago
An Aspect-Oriented Approach to Modular Behavioral Specification
Behavioral interface specification languages, such as Java Modeling Language (JML), can be used to specify the behavior of program modules. We have developed a behavioral interfac...
Kiyoshi Yamada, Takuo Watanabe
IANDC
2006
82views more  IANDC 2006»
13 years 10 months ago
Recognizability, hypergraph operations, and logical types
We study several algebras of graphs and hypergraphs and the corresponding notions of equational sets and recognizable sets. We generalize and unify several existing results which ...
Achim Blumensath, Bruno Courcelle