Sciweavers

229 search results - page 37 / 46
» Reminiscences related to graph theory
Sort
View
PODC
2009
ACM
14 years 2 months ago
Fast scalable deterministic consensus for crash failures
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
Bogdan S. Chlebus, Dariusz R. Kowalski, Michal Str...
MM
2009
ACM
277views Multimedia» more  MM 2009»
14 years 2 months ago
Inferring semantic concepts from community-contributed images and noisy tags
In this paper, we exploit the problem of inferring images’ semantic concepts from community-contributed images and their associated noisy tags. To infer the concepts more accura...
Jinhui Tang, Shuicheng Yan, Richang Hong, Guo-Jun ...
KR
2004
Springer
14 years 27 days ago
Updating of a Possibilistic Knowledge Base by Crisp or Fuzzy Transition Rules
In this paper, partial knowledge about the possible transitions which can take place in a dynamical environment is represented by a set of pairs of propositional formulae, with th...
Boris Mailhé, Henri Prade
COLT
1993
Springer
13 years 11 months ago
Parameterized Learning Complexity
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
Rodney G. Downey, Patricia A. Evans, Michael R. Fe...
ICCS
2007
Springer
14 years 1 months ago
Characterizing Implications of Injective Partial Orders
Abstract. Previous work of the authors has studied a notion of implication between sets of sequences based on the conceptual structure of a Galois lattice, and also a way of repres...
José L. Balcázar, Gemma C. Garriga