Sciweavers

21108 search results - page 391 / 4222
» A General Class of Models of
Sort
View
CP
2006
Springer
15 years 11 months ago
Constraint Programming Models for Graceful Graphs
The problem of finding a graceful labelling of a graph, or proving that the graph is not graceful, has previously been modelled as a CSP. A new and much faster CSP model of the pro...
Barbara M. Smith
IJPRAI
2010
105views more  IJPRAI 2010»
15 years 5 months ago
An Ontology-Based Model for Representing Image Processing Application Objectives
This paper investigates what kinds of information are necessary and sufficient to design and evaluate image processing software programs and proposes a representation of these inf...
Régis Clouard, Arnaud Renouf, Marinette Rev...
SIGMOD
2010
ACM
243views Database» more  SIGMOD 2010»
15 years 8 months ago
Non-homogeneous generalization in privacy preserving data publishing
Most previous research on privacy-preserving data publishing, based on the k-anonymity model, has followed the simplistic approach of homogeneously giving the same generalized val...
Wai Kit Wong, Nikos Mamoulis, David Wai-Lok Cheung
208
Voted
EUSFLAT
2009
137views Fuzzy Logic» more  EUSFLAT 2009»
15 years 5 months ago
Novel Methods for the Design of General Type-2 Fuzzy Sets based on Device Characteristics and Linguistic Labels Surveys
Fuzzy Logic Systems are widely recognized to be successful at modelling uncertainty in a large variety of applications. While recently interval type-2 fuzzy logic has been credited...
Christian Wagner, Hani Hagras
JSYML
2007
79views more  JSYML 2007»
15 years 7 months ago
Models of non-well-founded sets via an indexed final coalgebra theorem
The paper uses the formalism of indexed categories to recover the proof of a standard final coalgebra theorem, thus showing existence of final coalgebras for a special class of ...
Federico De Marchi, Benno van den Berg